zoukankan      html  css  js  c++  java
  • POJ 2000 Gold Coins

    Gold Coins
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 19537   Accepted: 12169

    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

    大水题一道,按题目要求求和,打表0MS过……

     

     1 #include<iostream>
     2 #include<cstdio>
     3 
     4 using namespace std;
     5 
     6 int ask;
     7 long result[10050];
     8 
     9 int main()
    10 {
    11     int t=1;
    12     for(int len=1;;len++)
    13     {
    14         for(int i=1;i<=len;i++)
    15         {
    16             if(t>10000)
    17                 goto ac;
    18             result[t]=result[t-1]+len;
    19             t++;
    20         }
    21     }
    22 
    23 ac: while(scanf("%d",&ask)==1)
    24     {
    25         if(ask==0)
    26             break;
    27         else
    28             printf("%d %ld
    ",ask,result[ask]);
    29     }
    30 
    31     return 0;
    32 }
    [C++]
  • 相关阅读:
    地方坐标系
    地图常用坐标系
    地图投影【百度百科】
    地图投影
    坐标系、坐标参照系、坐标变换、投影变换
    Scale和Resolution的含义及转换算法
    OpenStreetMap/Google/百度/Bing瓦片地图服务(TMS)
    面向对象的一些方法
    对象构造函数的原型图
    bookstarp的初体验
  • 原文地址:https://www.cnblogs.com/lzj-0218/p/3221192.html
Copyright © 2011-2022 走看看