zoukankan      html  css  js  c++  java
  • Y2K Accounting Bug(贪心)

    Y2K Accounting Bug
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 10945   Accepted: 5499

    Description

    Accounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for MS Inc.  All what they remember is that MS Inc. posted a surplus or a deficit each month of 1999 and each month when MS Inc. posted surplus, the amount of surplus was s and each month when MS Inc. posted deficit, the deficit was d. They do not remember which or how many months posted surplus or deficit. MS Inc., unlike other companies, posts their earnings for each consecutive 5 months during a year. ACM knows that each of these 8 postings reported a deficit but they do not know how much. The chief accountant is almost sure that MS Inc. was about to post surplus for the entire year of 1999. Almost but not quite. 
    Write a program, which decides whether MS Inc. suffered a deficit during 1999, or if a surplus for 1999 was possible, what is the maximum amount of surplus that they can post.

    Input

    Input is a sequence of lines, each containing two positive integers s and d.

    Output

    For each line of input, output one line containing either a single integer giving the amount of surplus for the entire year, or output Deficit if it is impossible.

    Sample Input

    59 237
    375 743
    200000 849694
    2500000 8000000
    

    Sample Output

    116
    28
    300612
    Deficit
    

    Source

    题目看不懂是硬伤,还一直以为每个月的surplus , deficit不一样;orz(最欠的就是这里,一样还报个p啊)
    posts their earnings for each consecutive 5 months during a year 这句话的理解:每5个月 的 意思是 1 ~ 5 ,2 ~ 6 , 3 ~ 7……8 ~ 12 orz
    这也解释了为毛会得到8张单子。
     1 #include<stdio.h>
     2 int s , d ;
     3 
     4 int main ()
     5 {
     6    // freopen ("a.txt" , "r" , stdin) ;
     7     int i , earn , two;
     8     while (~ scanf ("%d%d" , &s , &d)) {
     9         for (i = 1 ; i < 5 ; i++) {
    10             if (i * d > (5 - i) * s)
    11                 break ;
    12         }
    13         two = 0 ;
    14         if (i == 4)
    15             two = 1 ;
    16         if (i == 5) {
    17             puts ("Deficit") ;
    18             continue ;
    19         }
    20         earn = (12 - 2 * i - two) * s - (2 * i + two ) * d ;
    21         if (earn < 0) {
    22             printf ("Deficit
    ") ;
    23         }
    24         else
    25             printf ("%d
    " , earn ) ;
    26     }
    27     return 0 ;
    28 }
    View Code
  • 相关阅读:
    正则表达式 常见的简写形式
    Git 常用命令
    利用npm安装删除模块
    发送验证码设置settime(验证码倒计时)
    30分钟后过期(订单过期)
    JS 获取当前日期时间以及其他操作
    判断终端
    一个轻量、可拓展、针对手机网页的前端开发者调试面板vConsole
    数据结构与算法----树(中)
    数据结构与算法----树(上)
  • 原文地址:https://www.cnblogs.com/get-an-AC-everyday/p/4298683.html
Copyright © 2011-2022 走看看