zoukankan      html  css  js  c++  java
  • OpenJudge/Poj 2000 Gold Coins

    1.链接地址:

    http://bailian.openjudge.cn/practice/2000

    http://poj.org/problem?id=2000

    2.题目:

    总Time Limit:
    1000ms
    Memory Limit:
    65536kB
    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
    
    Source
    Rocky Mountain 2004

    3.思路:

    4.代码:

     1 #include "stdio.h"
     2 #include "stdlib.h"
     3 #include "math.h"
     4 int main()
     5 {
     6     int a,b;
     7     int i;
     8     int sum;
     9     scanf("%d",&a);
    10     while(a!=0)
    11     {
    12        sum=0;
    13        b=(sqrt(8*a+1)-1)/2;
    14        for(i=1;i<=b;i++)
    15        {
    16           sum+=i*i;
    17        }
    18        sum+=(b+1)*(a-b*(b+1)/2);
    19        printf("%d %d
    ",a,sum);
    20        scanf("%d",&a);
    21     }
    22     return 0;
    23 }
  • 相关阅读:
    选择高性能NoSQL数据库的5个步骤
    如何将 Redis 用于微服务通信的事件存储
    让你的AI模型尽可能的靠近数据源
    Collections.sort 给集合排序
    Bootstrap 文件上传插件File Input的使用
    select2 api参数的文档
    textarea 标签换行及靠左
    JSON
    JDK的get请求方式
    通讯录作业
  • 原文地址:https://www.cnblogs.com/mobileliker/p/3577414.html
Copyright © 2011-2022 走看看