ZCMU-训练赛-A
2017-01-11 15:40
274 查看
Problem A: Problem A - Y2K Accounting Bug
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 34 Solved: 19
[Submit][Status][Web
Board]
Description
Problem A - Y2K Accounting Bug
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 is a sequence of lines, each containing two positive integers s and d. 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.
Input
Output
Sample Input
59 237375 743
200000 849694
2500000 8000000
Sample Output
11628
300612
Deficit
【解析】
这道题就是说公司每五个月算一次账都是亏损的就是说五个月的盈利和亏损加下一起是负的,问你一年下来可以不可以
盈利,如果可以,能赚多少,这个时候我们就要想了怎么样保证它能赚的到钱。总共有五种情况,一种是在五个月当
中只亏一个月,另一种是五个月当中亏两个月,还有就是五个月当中全部亏本,还有个就是五个月当中亏四个月,最
后一种就是五个月全部亏损了。注意我们这是要满足每五个月算起来都是要亏损的。思路源自网络。五种情况都在代码
中列出。
#include<iostream> using namespace std; int main() { double s,d; while(cin>>s>>d) { double n; if(s>=0 && s<d/4) { n=10*s-2*d;//1.SSSSDSSSSDSS } if(s>=d/4&&s<2*d/3) { n=8*s-4*d;//2.SSSDDSSSDDSS } if(s>=2*d/3 && s<3*d/2) { n=6*s-6*d;//3.SSDDDSSDDDSS } if(s>=3*d/2 && s<4*d) { n=3*s-9*d;//4.SDDDDSDDDDSD } if(s<0 || s>=4*d)//每个月都要亏损,所以这样s>=4*d代表每个月都亏损,s<0也代表没有盈利 { n=-1;//5.DDDDDDDDDDDD } if(n>=0) cout<<n<<endl; else cout<<"Deficit\n"; } return 0; }
相关文章推荐
- ZCMU新人训练赛F
- ZCMU新人训练赛I
- ZCMU新人训练赛J
- ZCMU新人训练赛J
- ZCMU-训练赛-Primary Arithmetic
- ZCMU-训练赛-Problem A: Freckles
- ZCMU新人训练赛K
- ZCMU新人训练赛A
- ZCMU新人训练赛B
- ZCMU新人训练赛A
- ZCMU新人训练赛A
- ZCMU新人训练赛B
- 【D - ECJTU_ACM 11级队员2012年暑假训练赛(2)】
- 【ECJTU_ACM 11级队员2012年暑假训练赛(7) - F - Sign in】
- 【ECJTU_ACM 11级队员2012年暑假训练赛(8) - I - Lucky Division】
- 2013_CSUST_3_23校内训练赛第一场【old】【hdu 3496、2191、4508、4506、2181 POJ 3264 3210 3094】
- 2013 - ECJTU 暑期训练赛第二场-problem-J
- 2013暑假集训B组训练赛第一场
- 2013多校训练赛第三场 总结
- 2013 - ECJTU 暑期训练赛第八场-problem-E