Codeforces 610A Pasha and Stick
来源:互联网 发布:mac safari 缓存路径 编辑:程序博客网 时间:2024/05/22 03:43
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
6
1
20
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的木棍,将其分成4段,每段的长度也为整数,问组成矩形的有几种情况(正方形不算),注意考虑N为奇数的情况。
代码如下:
#include<stdio.h>#include<string.h>int main(){int i,n;while(~scanf("%d",&n)){if(n%2!=0)printf("0\n");else{int ans=0;for(i=1;i<n/2;i++){if(i%2==0)ans++;}printf("%d\n",ans);}}}
- Codeforces 610A Pasha and Stick 【水题】
- codeforces 610A Pasha and Stick
- 【CodeForces】[610A]Pasha and Stick
- Pasha and Stick Codeforces 610A
- CodeForces 610A Pasha and Stick
- Codeforces 610A Pasha and Stick
- 【CodeForces 610A】Pasha and Stick
- 【codeforces 610A】Pasha and Stick
- 610A Pasha and Stick
- CodeForces 610 A. Pasha and Stick(水~)
- CodeForces 610A Pasha and Stick (水)
- 【CodeForces】610A - Pasha and Stick(水)
- 【codeforces】-610A-Pasha and Stick(水)
- 【codeforces】Pasha and Stick
- 【codeforces】Pasha and Stick
- A. Pasha and Stick
- codefroces#337 A Pasha and Stick【思维】
- codefroces#337 A Pasha and Stick【思维】
- neural-networks-and-deep-learning multiple_eta.py
- (OK) install_Xen_on_Fedora.txt
- 套路重写Java的equals函数
- Leetcode Next Permutation
- SQLSERVER 启动sa用户登录
- Codeforces 610A Pasha and Stick
- PAT乙级 1022 D进制的A+B
- 蓝桥杯 ADV-108算法提高 分数统计
- 多线程编程摘录(二): 线程管理(2)
- Leetcode Subsets
- 蓝桥杯 ADV-104算法提高 打水问题
- fwrite与xxd这对黄金搭档帮我定位出乱码问题------无法打印日志时如何打日志?
- LeetCode--No.102--Binary Tree Level Order Traversal
- Android登陆背景移动渐变