标签：
题目链接：
http://poj.org/problem?id=2000
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
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
Hint:
题意：
国王给骑士金币，第一天给一个金币，第二天和第三天给两个金币，第三天，第四天以及第五天给三个金币以此类推，问第n天的时候应该给几个金币，输出的时候要求输出天数以及给的金币数。
题解：
就是简单的模拟，记得有公式可以做的，但是自己忘了，就直接模拟了一遍。
代码：
#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int n;
while(cin>>n&&n!=0)
{
int i,j;
int sum=0;
int cnt=n;
for(i=1,j=1;j<=n;j+=i,i++)
{
if(cnt>=i)
cnt-=i;
else
break;
sum+=(i*i);
}
sum+=cnt*i;
printf("%d %d\n",n,sum);
}
}
POJ 2000 Gold Coins
标签：
原文地址：http://www.cnblogs.com/TAT1122/p/5750872.html
