zoukankan      html  css  js  c++  java
  • Y2K Accounting Bug 分类: POJ 2015-06-16 16:55 14人阅读 评论(0) 收藏

    Y2K Accounting Bug
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 11222   Accepted: 5655

    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
    对于这个题,只要分几种情况就行了
    (1):当d>4*s时则十二个月最大盈利为ssssdssssdss
    (2):当2*d>3*s时十二个月最大盈利为sssddsssddss
    (3):当3*d>2*s时十二个月最大盈利为ssdddssdddss
    
    (4):当4*d>s时十二个月最大盈利为sddddsddddsd
    (5):当5*d>s时十二个月最大盈利为dddddddddddd
    #include <cctype>
    #include <cstdio>
    #include <cmath>
    #include <cstring>
    #include <cstdlib>
    #include <iostream>
    
    using namespace std;
    
    int main()
    {
        int s,d;
        while(~scanf("%d %d",&s,&d))
        {
            int sum=-1;
            if(d>4*s)
            {
                sum=10*s-2*d;
            }
            else if(2*d>3*s)
            {
                sum=8*s-4*d;
            }
            else if(3*d>2*s)
            {
                sum=6*s-6*d;
            }
            else if(4*d>s)
            {
                sum=3*s-9*d;
            }
            if(sum<0)
            {
                cout<<"Deficit"<<endl;
            }
            else
            {
                cout<<sum<<endl;
            }
        }
        return 0;
    }
    


    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    HFUT 1356.转啊转(安徽省2016“京胜杯”程序设计大赛 E)
    HFUT 1354.砝码称重(安徽省2016“京胜杯”程序设计大赛 A)
    AOJ 331.汉诺塔
    AOJ 763.过河卒
    AOJ 762.分数数列
    AOJ 761.Fibonacci序列
    AOJ 760.尾数相等的数
    POJ 1035.Spell checker
    POJ 2299.Ultra-QuickSort
    POJ 2503.Babelfish
  • 原文地址:https://www.cnblogs.com/juechen/p/4722025.html
Copyright © 2011-2022 走看看