POJ 2586

#include
    
    
     
     
using namespace std;

int main()
{
    int s,d,a,b,n,sum;
    cin>>s>>d;
    for(b=4;b>=0;b--)
    {
        a=5-b;
        if(s*b
     
     
      
      3)?(3*a-3):2*a;
    sum=s*(12-n)-d*n;
    if(sum>=0)cout<
      
      
       
       <
       
       
      
      
     
     
    
    

Y2K Accounting Bug

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9260		Accepted: 4605

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、2、3、4、5 , 2、3、4、5、6 ，…… ，8、9、10、11、12)，然后已知这八次统计每次都是亏损的,s代表每月的盈利，d代表每月的亏损（每月的s和d都相同），然后让你求该年能够盈利的最大利润是多少。

思路：贪心，假设每五个月中有a个月是d，b个月是s，想让b最大，b>=0&&b<=4,所以b从4递减，通过if(s*b<d*a)break来确定a，b

的值。将亏损都填在每五个月中的后几个月，这样亏损被不同板块共用的机会会更多，从而是总共的亏损月份数最少。

将1到12月列成一个顺序表，将每五个月想成一个整体填进去，类似于在广场铺地板砖的情况，这个时候想要把所有的格子都覆盖，就需要3块砖，

当a>3的时候，11,12月份才可能是亏损，假设12个月中亏损的月份有n个，则当a<=3时，n=2a,当a>3时，n=2a+a-3=3a-3.