Y2K Accounting Bug
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 11275 | Accepted: 5675 |
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.
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
题意：某公司要统计全年盈利状况，对于每一个月来说，如果盈利则盈利S，如果亏空则亏空D。
公司每五个月进行一次统计，全年共统计8次(1-5、2-6、3-7、4-8、5-9、6-10、7-11、8-12)，
已知这8次统计的结果全部是亏空(盈利-亏空<0)。题目给出S和D，判断全年是否能盈利，如果能则
求出盈利的最大值，如果不能盈利则输出Deficit
输入：每月盈利和亏空的数值（每月都一样）
输出：能最大盈利多少，不能则输出Deficit
题意懂了，其他都不难了，一共统计8次，8次都是亏空的，要保证尽量盈利。所以把亏空放到5月份，
如果还不能保证1-5月总额亏空，再在4月亏空，以此类推，直到1-5月亏空，6-10月复制1-5月。
全年的盈亏情况可以由前五个月直接决定
1、若SSSSD亏空，那么全年最优情况为SSSSDSSSSDSS
2、若SSSDD亏空，那么全年最优情况为SSSDDSSSDDSS
3、若SSDDD亏空，那么全年最优情况为SSDDDSSDDDSS
4、若SDDDD亏空，那么全年最优情况为SDDDDSDDDDSD
5、若DDDDD亏空，全年必亏空...
题意： 有一个公司由于某个病毒使公司赢亏数据丢失，但该公司每月的 赢亏是一个定数，要么一个月赢利s，要么一月亏d。现在ACM只知道该公司每五个月有一个赢亏报表，而且每次报表赢利情况都为亏。在一年中这样的报表总共有8次（1到5，2到6，…，8到12），现在要编一个程序确定当赢s和亏d给出，并满足每张报表为亏的情况下，全年公司最高可赢利多少，若存在，则输出多多额，若不存在，输出"Deficit"。
分析：
在保证连续5个月都亏损的前提下，使得每5个月中亏损的月数最少。
x=1: ssssd,ssssd,ss d>4s 赢利10个月 10s-2d
x=2: sssdd,sssdd,ss 2d>3s 赢利8个月 8s-4d
x=3: ssddd,ssddd,ss 3d>2s 赢利6个月 6s-6d
x=4: sdddd,sdddd,sd 4d>s 赢利3个月 3s-9d
x=5: ddddd,ddddd,dd 4d<s 无赢利
x=2: sssdd,sssdd,ss 2d>3s 赢利8个月 8s-4d
x=3: ssddd,ssddd,ss 3d>2s 赢利6个月 6s-6d
x=4: sdddd,sdddd,sd 4d>s 赢利3个月 3s-9d
x=5: ddddd,ddddd,dd 4d<s 无赢利
#include<stdio.h>
int main(){
int s,d;
while(scanf("%d%d",&s,&d)!=EOF){
int ans;
if(d-4*s>0)
ans=10*s-2*d;
else if(2*d-3*s>0)
ans=8*s-4*d;
else if(3*d-2*s>0)
ans=6*(s-d);
else if(4*d-s>0)
ans=3*s-9*d;
else
ans=-12*d;
if(ans<0)
printf("Deficit
");
else
printf("%d
",ans);
}
return 0;
}