hpu暑假训练F - Pasha and Stick 【思维】&&【水题】
2017-07-28 18:01
543 查看
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 ben.
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 integerx, such that the number of parts of lengthx
in the first way differ from the number of parts of lengthx 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.
Example
Input
Output
Input
Output
Note
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.
解析:
一个要求必须是偶数,分成四份,两两相等,四个全部相等舍去。找出规律就很容易了。偶数/4,如果偶数%4==0,就减去一。
程序如下:
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 ben.
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 integerx, such that the number of parts of lengthx
in the first way differ from the number of parts of lengthx 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.
Example
Input
6
Output
1
Input
20
Output
4
Note
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.
解析:
一个要求必须是偶数,分成四份,两两相等,四个全部相等舍去。找出规律就很容易了。偶数/4,如果偶数%4==0,就减去一。
程序如下:
#include<cstdio> int main() { long long n; scanf("%lld",&n); int sum=0; if(n%2!=0) printf("0\n"); else { sum=n/4; if(n%4==0) sum--; printf("%d\n",sum); } return 0; }
相关文章推荐
- hpu暑假训练C - Patrick and Shopping 【思维】&&【水题】
- hpu暑假训练C - Trailing Zeroes (III) 【二分法】&&【思维转化】
- hpu暑假训练 E: YK的书架【思维】
- hpu寒假训练D-Rikka with Chess 【思维&&找规律】
- hpu暑假训练【最长公共子序列&&回溯输出】
- hpu暑假训练 G - 免费馅饼
- hpu暑假训练 B - Bridging signals 【LIS】
- 暑假训练第二期---思维题2
- hpu暑假训练G - New Year and Days【数学】
- hpuoj 【1067】拍七游戏【水题】&&【思维】
- hpu暑假训练I - Restaurant 【贪心】
- hpu暑期训练:I - 0和5 【思维】
- hpuoj【1188】Pесторан【思维】&&【水题】
- hpu暑假训练B - Pie 【二分法】
- hpuoj 【1288】数组次值 【水题】&&【sort】
- HPU-1411: QAQ & ORZ 的签到题 [水题]
- hpu暑假训练D - How Many Tables 【并查集】
- hpu暑假训练【拓扑解题思路以及模板】
- hpu暑假训练 B - Ignatius and the Princess IV 【sort】
- hpu 1701 最后一个1 <水题>