POJ2140:Herd Sums
来源:互联网 发布:cherry键盘适配mac 编辑:程序博客网 时间:2024/05/24 05:20
Description
The cows in farmer John's herd are numbered and branded with consecutive integers from 1 to N (1 <= N <= 10,000,000). When the cows come to the barn for milking, they always come in sequential order from 1 to N.
Farmer John, who majored in mathematics in college and loves numbers, often looks for patterns. He has noticed that when he has exactly 15 cows in his herd, there are precisely four ways that the numbers on any set of one or more consecutive cows can add up to 15 (the same as the total number of cows). They are: 15, 7+8, 4+5+6, and 1+2+3+4+5.
When the number of cows in the herd is 10, the number of ways he can sum consecutive cows and get 10 drops to 2: namely 1+2+3+4 and 10.
Write a program that will compute the number of ways farmer John can sum the numbers on consecutive cows to equal N. Do not use precomputation to solve this problem.
Farmer John, who majored in mathematics in college and loves numbers, often looks for patterns. He has noticed that when he has exactly 15 cows in his herd, there are precisely four ways that the numbers on any set of one or more consecutive cows can add up to 15 (the same as the total number of cows). They are: 15, 7+8, 4+5+6, and 1+2+3+4+5.
When the number of cows in the herd is 10, the number of ways he can sum consecutive cows and get 10 drops to 2: namely 1+2+3+4 and 10.
Write a program that will compute the number of ways farmer John can sum the numbers on consecutive cows to equal N. Do not use precomputation to solve this problem.
Input
* Line 1: A single integer: N
Output
* Line 1: A single integer that is the number of ways consecutive cow brands can sum to N.
Sample Input
15
Sample Output
4
//有多少个奇因子,就有多少情况
#include <iostream>using namespace std;int main(){ int n,i,cnt; while(cin >> n) { cnt = 0; for(i = 1;i<=n;i+=2) if(n%i==0) cnt++; cout << cnt << endl; } return 0;}
- (POJ2140)Herd Sums
- POJ2140:Herd Sums
- poj2140-Herd Sums
- 【POJ2140】Herd Sums(数学)
- Herd Sums
- Herd Sums
- Herd Sums
- POJ 2140 Herd Sums
- pku 2140 Herd Sums
- poj 2140 Herd Sums
- POJ 2140 Herd Sums
- poj 2140 Herd Sums
- hdu 2715 Herd Sums
- HDU2715 Herd Sums
- hdoj-2715-Herd Sums
- HDU 2715 Herd Sums
- POJ_2410 Herd Sums
- (POJ)2140 Herd Sums
- 何去何从
- 面试100题系列之10关于删除多余空格的再思考
- java 判断类和实例的关系(instanceof,isInstance,isAssignableFrom)
- android手机删除自带的rom软件
- Hibernate的数据库方言错误值
- POJ2140:Herd Sums
- 无法解析的外部符号 _WinMain@16
- hdu 2087 BF 和 KMP算法
- 黑马程序员_银行业务调度系统
- C Puzzles - NO.3
- 多组曲线回到一组图中显示比较
- 常用php函数
- Java正则表达式入门
- Servlet 中文乱码问题及解决方案剖析