Gold Coins
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 10469 | Accepted: 6505 |
Description
The
king pays his loyal knight in gold coins. On the first day of his
service, the knight receives one gold coin. On each of the next two
days (the second and third days of service), the knight receives two
gold coins. On each of the next three days (the fourth, fifth, and
sixth days of service), the knight receives three gold coins. On each
of the next four days (the seventh, eighth, ninth, and tenth days of
service), the knight receives four gold coins. This pattern of payments
will continue indefinitely: after receiving N gold coins on each of N
consecutive days, the knight will receive N+1 gold coins on each of the
next N+1 consecutive days, where N is any positive integer.
Your program will determine the total number of gold coins paid to the knight in any given number of days (starting from Day 1).
Your program will determine the total number of gold coins paid to the knight in any given number of days (starting from Day 1).
Input
The
input contains at least one, but no more than 21 lines. Each line of
the input file (except the last one) contains data for one test case of
the problem, consisting of exactly one integer (in the range 1..10000),
representing the number of days. The end of the input is signaled by a
line containing the number 0.
Output
There
is exactly one line of output for each test case. This line contains
the number of days from the corresponding line of input, followed by
one blank space and the total number of gold coins paid to the knight
in the given number of days, starting with Day 1.
Sample Input
10 6 7 11 15 16 100 10000 1000 21 22 0
Sample Output
10 30 6 14 7 18 11 35 15 55 16 61 100 945 10000 942820 1000 29820 21 91 22 98
本题的关键是在于设置一个递增的Factor,过N个数字之后,将Factor调整成N+1。
import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(true) { int day = Integer.valueOf(cin.nextLine()).intValue(); if(day == 0) break; System.out.println(day + " " + getTotalCoin(day)); } } private static int getTotalCoin(int day) { int total = 1; int factor = 2; int index = 0; if(day == 1) return 1; for(int i = 2; i <= day; i++) { if(index == factor) { index = 0; factor ++; } total += factor; index ++; } return total; } }
发表评论
-
POJ ACM习题【No.2328】
2009-07-05 19:43 896Guessing 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 921Gauß in Elementary School ... -
POJ ACM习题【No.3176】
2009-04-26 10:53 1043Cow Bowling Time Lim ... -
POJ ACM习题【No.3173】
2009-04-25 23:30 901Parkside's Triangle ... -
POJ ACM习题【No.2845】
2009-04-25 22:25 121001000001 Time Limit: ... -
POJ ACM习题【No.2140】
2009-04-25 21:26 933Herd Sums Time Limit ... -
POJ ACM习题【No.1969】
2009-04-25 20:59 859Count 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 1008Mileage Bank Time Li ... -
POJ ACM习题【No.3325】
2009-04-24 21:15 1088ICPC Score Totalizer Software ... -
POJ ACM习题【No.2756】
2009-04-24 20:28 771Autumn is a Genius T ... -
POJ ACM习题【No.3062】
2009-04-24 20:10 806Celebrity jeopardy ... -
POJ ACM习题【No.1547】
2009-04-23 20:03 771Clay Bully Time Limi ... -
POJ ACM习题【No.1552】
2009-04-23 19:39 748Doubles Time Limit: ... -
POJ ACM习题【No.1007】
2009-04-23 19:24 847DNA 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 858Hay Points Time Limi ... -
POJ ACM习题【No.1862】
2009-04-22 20:12 696Stripies Time Limit: ...
相关推荐
方便大家有针对性地联系 祝大家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