Herd Sums
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 8376 | Accepted: 5027 |
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
可以从中间进行查找,Index = Num/2+1
import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(cin.hasNext()) { int num = cin.nextInt(); int ways = 1; int index = num/2+1; for(int i = index; i > 1; i--) { int tmpNum = i; for(int j = i - 1; j > 0; j--) { tmpNum += j; if(tmpNum == num) { ways++; break; }else if(tmpNum > num) break; } } System.out.println(ways); } } }
发表评论
-
POJ ACM习题【No.2328】
2009-07-05 19:43 895Guessing Game Time ... -
POJ ACM习题【No.3157】
2009-04-26 23:54 1633Java vs C++ Time Lim ... -
POJ ACM习题【No.2924】
2009-04-26 11:52 919Gauß in Elementary School ... -
POJ ACM习题【No.3176】
2009-04-26 10:53 1042Cow Bowling Time Lim ... -
POJ ACM习题【No.3173】
2009-04-25 23:30 899Parkside's Triangle ... -
POJ ACM习题【No.2845】
2009-04-25 22:25 120801000001 Time Limit: ... -
POJ ACM习题【No.1969】
2009-04-25 20:59 857Count on Canton Time ... -
POJ ACM习题【No.2840】
2009-04-25 19:24 1002Big Clock Time Limit ... -
POJ ACM习题【No.2521】
2009-04-24 22:41 846How much did the businessman l ... -
POJ ACM习题【No.1326】
2009-04-24 22:14 1007Mileage Bank Time Li ... -
POJ ACM习题【No.3325】
2009-04-24 21:15 1087ICPC Score Totalizer Software ... -
POJ ACM习题【No.2756】
2009-04-24 20:28 770Autumn is a Genius T ... -
POJ ACM习题【No.3062】
2009-04-24 20:10 804Celebrity jeopardy ... -
POJ ACM习题【No.1547】
2009-04-23 20:03 770Clay Bully Time Limi ... -
POJ ACM习题【No.1552】
2009-04-23 19:39 747Doubles Time Limit: ... -
POJ ACM习题【No.1007】
2009-04-23 19:24 845DNA Sorting Time Lim ... -
POJ ACM习题【No.1565】
2009-04-22 22:40 839Skew Binary Time Lim ... -
POJ ACM习题【No.2403】
2009-04-22 22:18 857Hay Points Time Limi ... -
POJ ACM习题【No.1862】
2009-04-22 20:12 694Stripies Time Limit: ... -
POJ ACM习题【No.3224】
2009-04-22 19:57 740Lab杯 Time Limit: 1 ...
相关推荐
方便大家有针对性地联系 祝大家AC愉快~
pojACM题目分类,便于各类型同学分别做题有所参考
相信大家在做poj上的题目的时候如果没有分类的话很迷茫吧....这里有一份目前比较全面的poj题目分类..
02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ...
acm数据结构总结.doc acm数据结构总结.doc
poj acm题解,包括绝大部分poj题目的题解,可以供acm爱好者学习研究
本文件是ACM里的一些题目的源码、原题和习题的分析及详细解答。欢迎各位下载
http://acm.pku.edu.cn/JudgeOnline/ acm的AC解题报告
POJ ACM 1015 Jury Compromise 两种解法 解题报告
西工大C语言POJ习题答案.docx
PKU 、POJ ACM/ICPC300多题的代码,还有各种典型问题的分类代码
poj 2007 Scrambled Polygon.md
poj 3183 Stump Removal.md
poj 2430 Lazy Cows.md
poj 2900 Griddy Hobby.md
poj 3435 Sudoku Checker.md
poj 1984 Navigation Nightmare.md
poj 2174 Decoding Task.md
poj 2386 Lake Counting.md
poj 3585 Accumulation Degree.md