POJ_2000_Gold_Coins.c

/*——————————————————————————
File name: POJ_2000_Gold_Coins.c
Author: wtthappy (email: wtthappy@hotmail.com )
Created on: 1/9/2008
Environment: WinXPSP2 CHN Pro + Dev-C++ 4.9.9.0

Problem statement:
——————————————————————————–

http://acm.pku.edu.cn/JudgeOnline/problem?id=2000

Gold Coins
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 6391 Accepted: 4172

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 <stdio.h>
#define MAX 10000

int array[MAX+1][2];

int main()
{
    int input;
    int coin = 1,total;
    int day = 0;
    
    while ( day < MAX )
    {
        int i = coin;
        while ( i-- )
        {
            array[++day][0] = coin;
            array[day][1] = array[day-1][1]+coin;
            if ( day == MAX )
            {
                break;
            }    
        }    
        ++coin;
    }
    
    while ( scanf( "%d", &input ), input != 0 )
    {
        printf( "%d %d\n", array[input][0], array[input][1] );
    }    
    
    system( "PAUSE" );
    return 0;
}   

发表评论

电子邮件地址不会被公开。 必填项已用 * 标注

您可以使用这些 HTML 标签和属性: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>