2000Gold Coins
2015-07-28 15:33
246 查看
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
Source
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 21868 | Accepted: 13696 |
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
Source
#include<iostream> using namespace std; int main() { int n; while(cin>>n) { if(!n) break; int m=n; int sum=0; int i=0; while(n) { i++; if(n>i) {n=n-i; sum+=i*i; } else { sum+=i*n; break; } } cout<<m<<" "<<sum<<endl; } }
相关文章推荐
- django中使用south同步对model的修改
- google nfc 基础文档翻译 (上)
- go语言循环语句 for
- golang channel 用法转的
- go语言选择语句 switch case
- go语言条件语句 if else
- Algorithms—238.Product of Array Except Self
- Golang Channel 整理
- golang 类型转换
- 基本的Logos语法
- GoogleApis 屏蔽
- HangOver
- 前向分步算法(forward stagewise algorithm)
- Golang网页下载示例
- 【Google】25匹马的角逐
- Django basic command
- hdu 4722 Good Numbers(数位dp)
- HDU 2092 整数解
- django 1.8 官方文档翻译: 3-6-1 中间件概览
- 谷歌注册多个与Google Play和 China相关域名