CodeForces 610A Pasha and Stick
2016-07-21 18:12
288 查看
F - Pasha and Stick
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Pasha has a wooden stick of some positive integer length n. He wants to perform exactly three cuts to get four parts of the stick. Each part must have some positive integer length and the sum
of these lengths will obviously be n.
Pasha likes rectangles but hates squares, so he wonders, how many ways are there to split a stick into four parts so that it's possible to form a rectangle using these parts, but is impossible to form a square.
Your task is to help Pasha and count the number of such ways. Two ways to cut the stick are considered distinct if there exists some integer x, such that the number of parts of length x in
the first way differ from the number of parts of length x in the second way.
Input
The first line of the input contains a positive integer n (1 ≤ n ≤ 2·109) — the length of Pasha's
stick.
Output
The output should contain a single integer — the number of ways to split Pasha's stick into four parts of positive integer length so that it's possible to make a rectangle by connecting the ends of these parts, but is impossible to form a square.
Sample Input
Input
Output
Input
Output
Hint
There is only one way to divide the stick in the first sample {1, 1, 2, 2}.
Four ways to divide the stick in the second sample are {1, 1, 9, 9}, {2, 2, 8, 8}, {3, 3, 7, 7} and {4, 4, 6, 6}. Note that {5, 5, 5, 5} doesn't work.
题意:给出长度为n的木棍,通过截取三次,得到的四根木棍要能拼成矩形(不是正方形),问有多少种解法。
#include<stdio.h>
int main()
{
__int64 n,m,i,j,k;
while(scanf("%I64d",&n)!=EOF)
{
if(n%2!=0)
printf("0\n");
else
{
m=n/4;
if(n%4==0)
m--;
printf("%I64d\n",m);
}
}
}
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Pasha has a wooden stick of some positive integer length n. He wants to perform exactly three cuts to get four parts of the stick. Each part must have some positive integer length and the sum
of these lengths will obviously be n.
Pasha likes rectangles but hates squares, so he wonders, how many ways are there to split a stick into four parts so that it's possible to form a rectangle using these parts, but is impossible to form a square.
Your task is to help Pasha and count the number of such ways. Two ways to cut the stick are considered distinct if there exists some integer x, such that the number of parts of length x in
the first way differ from the number of parts of length x in the second way.
Input
The first line of the input contains a positive integer n (1 ≤ n ≤ 2·109) — the length of Pasha's
stick.
Output
The output should contain a single integer — the number of ways to split Pasha's stick into four parts of positive integer length so that it's possible to make a rectangle by connecting the ends of these parts, but is impossible to form a square.
Sample Input
Input
6
Output
1
Input
20
Output
4
Hint
There is only one way to divide the stick in the first sample {1, 1, 2, 2}.
Four ways to divide the stick in the second sample are {1, 1, 9, 9}, {2, 2, 8, 8}, {3, 3, 7, 7} and {4, 4, 6, 6}. Note that {5, 5, 5, 5} doesn't work.
题意:给出长度为n的木棍,通过截取三次,得到的四根木棍要能拼成矩形(不是正方形),问有多少种解法。
#include<stdio.h>
int main()
{
__int64 n,m,i,j,k;
while(scanf("%I64d",&n)!=EOF)
{
if(n%2!=0)
printf("0\n");
else
{
m=n/4;
if(n%4==0)
m--;
printf("%I64d\n",m);
}
}
}
相关文章推荐
- Redis学习笔记三——redis分布式安装
- Socket Error # 10054
- 辖vim之威学习emacs -进阶篇
- iOS 客户端的本地缓存处理
- Fragment和Activity生命周期以及横竖屏切换对生命周期的影响
- poj2632 Crashing Robots
- php上传文件 动态传参
- poj2632 Crashing Robots
- centos 如何用 rsyslog 搭建本地日志服务(续1: omprog模块与php deamon的配合使用)
- IOS中延时执行的几种方式的比较和汇总
- log4的使用及诠释
- 新手疑惑:谈谈python 中__name__ = '__main__' 的作用
- Ftl 数据处理总结
- Android 读取<meta-data>元素的数据
- Java_IO_File
- 运维日记005 - vim操作总结(一、软件包与安装)
- LeetCode 242. Valid Anagram
- 【最长下降子序列】【动态规划】【二分】XMU 1041 Sequence
- 转:国内Top500Android应用分析报告
- 4-sql高级教程