好贷网好贷款

Gold Coins

发布时间:2016-12-3 23:50:06 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"Gold Coins",主要涉及到Gold Coins方面的内容,对于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 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 #include<iostream> #include<string.h> #include<stdio.h> #include<ctype.h> #include<algorithm> #include<stack> #include<queue> #include<set> #include<math.h> #include<vector> #include<deque> #include<list> using namespace std; int main() { int n,s=0,i,j,count=0; while(scanf("%d",&n)!=EOF) { s=0; if(n==0) break; else { int k=0,m=1; count=0; for(i=1;i<=n;i++) { k++; count+=k; if(count>n) k=n-count+k; for(j=1;j<=k;j++) { s+=m;i++; } m++;i--; } printf("%d %d\n",n,s); } } return 0; }

上一篇:关于机器学习与编译器自主编程的关系联想
下一篇:九度OJ 1118 数制转换

相关文章

关键词: Gold Coins

相关评论