[ACM] POJ 2000 Gold Coins
来源:互联网 发布:英语网络热词怎么来的 编辑:程序博客网 时间:2024/05/19 22:56
Gold Coins
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20913 Accepted: 13098
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
106711151610010000100021220
Sample Output
10 306 147 1811 3515 5516 61100 94510000 9428201000 2982021 9122 98
Source
Rocky Mountain 2004
解题思路:
题意为 第一天获得1个硬币,后两天每天获得两个硬币,后三天每天获得三个硬币:如前6天每天获得的硬币数为 1 2 2 3 3 3
问第n天一共获得多少硬币。思路为判断第n天包括几个连续的时间段(比如获得1硬币的一天 获得2硬币的两天 获得3硬币的三天)以及多出来不是一个完整的时间段的那几天,代码中用extra,并记录下多出来的这几天是第几个连续时间段。总金币= 完整时间段获得的+ 余下的天数获得的
代码:
#include <queue>#include <iostream>#include <string.h>#include <stack>#include <iomanip>#include <cmath>using namespace std;int cnt(int n){ int totalday=0; int get=0; int i; int extra;//不是一个完整的连续i天的那几天,比如1 2 2 3,extra则为1,获得3个硬币的那一天 for(i=1;i<=n;i++) { totalday+=i; if(totalday>n) { extra=n-(totalday-i); break; } get+=i*i; } get+=extra*i; return get;}int main(){ int n; while(cin>>n&&n) { cout<<n<<" "<<cnt(n)<<endl; } return 0;}
0 0
- [ACM] POJ 2000 Gold Coins
- POJ 2000 Gold Coins
- poj 2000 Gold Coins
- poj 2000 Gold Coins
- poj 2000 Gold Coins
- POJ 2000 - Gold Coins
- POJ 2000 Gold Coins
- POJ 2000 Gold Coins
- poj 2000 Gold Coins
- POJ-2000 Gold Coins
- Gold Coins POJ 2000
- POJ 2000 Gold Coins
- poj 2000 Gold Coins
- POJ 2000 Gold Coins
- POJ 2000 Gold Coins(模拟)
- poj 2000 Gold Coins(水题)
- POJ 2000 Gold Coins 水题
- Gold Coins - POJ 2000 水题
- 期望值Markov过程(马尔科夫过程),hdu1204糖果大战
- 重写findobj【可以遍历子文件夹】
- 提交form表单,不跳转页面
- [直播]2014 PKU ACM暑期集训
- hdu 1019 Least Common Multiple(数论:求最小公倍数)
- [ACM] POJ 2000 Gold Coins
- kettle入门(二) 之 kettle连接oracle报的坑爹错误 Error occured while trying to connect to the database 的几种情况
- 课程设计-stm32+ov7670+JPEG+bmp+RM04_WIFI+二值图像
- Merge k Sorted Lists
- 利用两种不同的数据结构实现双端栈
- android adb常用指令
- 健客行-睡觉之午睡的学问
- B、BL、BX、BLX 和 BXJ
- 二分法(折半)查找java实现