Pasha and Stick(纯数学问题)
2016-07-21 17:24
302 查看
Pasha and Stick
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
SubmitStatus
Description
Pasha has a wooden stick of some positive integer lengthn. 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 integern (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
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
SubmitStatus
Description
Pasha has a wooden stick of some positive integer lengthn. 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 integern (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 给出木棍长n,砍三下,问有多少种组成长方形的方法
#include<stdio.h> #include<iostream> #include<algorithm> using namespace std; int main(){ __int64 n,l1,l2,i; while(~scanf("%I64d",&n)) { int k = 0; if(n%2!=0){ printf("0\n"); continue; } for(i=1;i<=n/4;i++) { l1 = n/2-i; l2 = n/2-i-l1; if(l2==0&&l1!=i&&l1>0){ k++; } } printf("%d\n",k); } return 0; }
相关文章推荐
- 内置对象学习笔记
- cocos2dx-js 绑定c++
- 2016 Multi-University Training Contest 2 1001 hdu 5734 暴力
- gdb调试详解
- 解决MYSQL连接慢问题
- 遍历Map的四种方法
- 数组作为形参
- DOM对象模型高级编程(增查)
- SDUT1130数据结构上机测试1:顺序表的应用(上一个代码太蠢)
- 帝国cms添加栏目前台显示正常,后台管理栏目中不显示
- 如何在网站中加入百度统计
- 线程安全与共享资源
- linux命令提示符显示当前完整路径
- Error running app: This version of Android Studio is incompatible with the Gradle Plugin used. Try d
- 推荐系统 - 1 - 相似度
- 评价UML工具
- 生成设备节点
- BootStrap 标签页
- Maven搭建 Spring环境
- PHP、JAVA、C#、Object-C 通用的DES加密