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 }
  • 相关阅读:
    flutter 报错DioError [DioErrorType.DEFAULT]: Error on line 1, column 17: Invalid media type: expected no more input.
    flutter 报错 DioError [DioErrorType.DEFAULT]: Bad state: Insecure HTTP is not allowed by platform
    什么是负载测试?什么是性能测试?
    性能测试包含了哪些测试(至少举出3种)
    简述使用Loadrunner的步骤。
    什么时候可以开始执行性能测试?
    apache ab压力测试工具
    webbench 的安装以及使用
    python3 django 电影网站项目
    音乐网站 前端html5模版
  • 原文地址:https://www.cnblogs.com/mobileliker/p/3577414.html
Copyright © 2011-2022 走看看