acm_problem_1013
来源:互联网 发布:java agent 做监控 编辑:程序博客网 时间:2024/06/07 14:46
题目描述:
Problem 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 237375 743200000 8496942500000 8000000
Sample Output
11628300612Deficit
大意:公司一年中无论哪个连续的五个月都是亏的,让求最大能盈利多少。。
想法:可以分几种情况,看看输入的数据满足哪种情况,依次五个月中亏1个月,两个,三个,四个。。然后用if else语句就可以算出来。。
代码:
#include <iostream>
using namespace std;int main()
{
int s,d,W;
while((cin>>s)&&(cin>>d))
{
if(d>4*s)
W=10*s-2*d;
else if(2*d>3*s)
W=8*s-4*d;
else if(3*d>2*s)
W=6*s-6*d;
else if(4*d>s)
W=3*s-9*d;
else W=-1;
if(W<0)
cout<<"Deficit"<<endl;
else
cout<<W<<endl;
}
return 0;
}
感想:一开始惯性思维第四个if语句写成4*s-8*d了,后来找了老长时间才找到,做题一定要细心。。
0 0
- acm_problem_1013
- 约瑟夫环--数组实现
- hdoj The sum problem 2058 (数学等差公式&技巧转换)
- Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missi
- Gradle for Android(二)全局设置、自定义BuildConfig、混淆
- 解决 RHEL 7/ CentOS 7/Fedora 出现Unit iptables.service failed to load
- acm_problem_1013
- 感兴趣区域检测技术
- 视图布局向上偏移的原因及解析
- iOS开发-进阶:NSArray倒序输出
- gem install sass 本地配置和淘宝源无效的解决办法
- Java 四种线程池的用法分析
- 循环队列--数组实现
- Kafka Java API示例
- 网络爬虫基本流程及开源爬虫