贪心(盈利问题)
来源:互联网 发布:android基站定位源码 编辑:程序博客网 时间:2024/04/28 12:54
DescriptionView Code
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.
//Memory Time //256K 16MS #include<iostream>using namespace std;int main(void){ double s,d; while(cin>>s>>d) { bool flag=false; int surplus=0; if(s>=4*d) flag=true; else if((s>=1.5*d)&&(s<4*d)) { surplus=3*s-9*d; if(surplus<0) flag=true; } else if((s>=0.666666*d)&&(s<1.5*d)) { surplus=6*(s-d); if(surplus<0) flag=true; } else if((s>=0.25*d)&&(s<0.666666*d)) { surplus=8*s-4*d; if(surplus<0) flag=true; } else if((s>=0)&&(s<0.25*d)) { surplus=10*s-2*d; if(surplus<0) flag=true; } if(flag) cout<<"Deficit"<<endl; else cout<<surplus<<endl; } return 0;}
59 237375 743200000 8496942500000 8000000
Sample Output
11628300612Deficit
0 0
- 贪心(盈利问题)
- poj2586(贪心问题,区间盈利类型)
- SDAU 贪心专题 13 盈利问题
- 硬币问题(贪心)
- HDU_1009 (贪心问题)
- 乘船问题(贪心)
- 硬币问题 (贪心)
- 贪心算法 Problem N 1013 求最大盈利
- 背包问题(贪心算法)
- 旅行规划问题(贪心)
- 部分背包问题(贪心)
- 区间覆盖问题(贪心)
- 程序存储问题(贪心)
- 汽车加油问题(贪心)
- 会场安排问题(贪心)
- 区间相交问题(贪心)
- 区间选点问题(贪心)
- 区间覆盖问题(贪心)
- 自制FFmpeg SDK并使用output_example测试
- Android:如何设计一个完全不可见的Activity?
- 枚举(+-)
- Java二分查找算法
- 贪心
- 贪心(盈利问题)
- 构造发
- 模拟括号
- Git中级用户的25个提示
- 亡命逃窜(3DBFS)
- 亡命逃窜(3DBFS)
- 机器人在盘内是否会相撞
- 机器人在盘内是否会相撞
- 几步能走出矩阵或者走入循环