Gold Coins - POJ 2000 水题
2014-06-27 22:18
309 查看
Gold Coins
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).
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
Sample Output
题意:在每轮的n天内每天给n块金币,下一轮在n+1天内,每天给n+1块金币。
思路:打表。
AC代码如下:
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 20862 | Accepted: 13065 |
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).
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
题意:在每轮的n天内每天给n块金币,下一轮在n+1天内,每天给n+1块金币。
思路:打表。
AC代码如下:
#include<cstdio> #include<cstring> using namespace std; int num[20010]; int main() { int i=0,j,k=0; while(i<=10000) { k++; for(j=1;j<=k;j++) { num[i+1]=num[i]+k; i++; } } while(~scanf("%d",&k) && k>0) printf("%d %d\n",k,num[k]); }
相关文章推荐
- [2000]Gold Coins(水题)POJ
- [2000]Gold Coins(水题)POJ
- poj 2000 Gold Coins(水题)
- poj 2000 Gold Coins(水题)
- poj 2000 Gold Coins(水题)
- POJ 2000 Gold Coins 水题
- OpenJudge/Poj 2000 Gold Coins
- poj 2000 Gold Coins
- POJ 2000 Gold Coins(水题,数学找规律)
- poj 2000 Gold Coins
- poj_2000 水题
- 【水】POJ 2000——Gold Coins
- POJ 2000 Gold Coins(模拟)
- (简单模拟2.4.1)POJ 2000 Gold Coins(确定大数字序列中的某一位置在小数字序列中的位置)
- poj 2000 水题(JAVA)
- poj 2000 Gold Coins
- POJ - 2000 Gold Coins
- poj 2000 Gold Coins
- POJ 2000 Gold Coins 简单模拟
- POJ 2000 Gold Coins