Poj 3030 Nasty Hacks
来源:互联网 发布:淘宝steam激活码哪来的 编辑:程序博客网 时间:2024/05/16 09:07
1.Link:
http://poj.org/problem?id=3030
2.Content:
Nasty HacksTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12350 Accepted: 8537Description
You are the CEO of Nasty Hacks Inc., a company that creates small pieces of malicious software which teenagers may use to fool their friends. The company has just finished their first product and it is time to sell it. You want to make as much money as possible and consider advertising in order to increase sales. You get an analyst to predict the expected revenue, both with and without advertising. You now want to make a decision as to whether you should advertise or not, given the expected revenues.
Input
The input consists of n cases, and the first line consists of one positive integer giving n. The next n lines each contain 3 integers, r, e and c. The first, r, is the expected revenue if you do not advertise, the second, e, is the expected revenue if you do advertise, and the third, c, is the cost of advertising. You can assume that the input will follow these restrictions: −106 ≤ r, e ≤ 106 and 0 ≤ c ≤ 106.
Output
Output one line for each test case: “advertise”, “do not advertise” or “does not matter”, presenting whether it is most profitable to advertise or not, or whether it does not make any difference.
Sample Input
30 100 70100 130 30-100 -70 40Sample Output
advertisedoes not matterdo not advertiseSource
Nordic 2006
3.Method:
4.Code:
1 #include<iostream> 2 using namespace std; 3 int main() 4 { 5 int i,n; 6 int r,e,c; 7 int result; 8 cin>>n; 9 for(i=0;i<n;i++)10 {11 cin>>r>>e>>c;12 result=e-c-r;13 if(result>0) cout<<"advertise"<<endl;14 else if(result<0) cout<<"do not advertise"<<endl;15 else cout<<"does not matter"<<endl;16 }17 //system("pause");18 return 1;19 20 }
5.Reference:
- POJ 3030 Nasty Hacks
- poj 3030 Nasty Hacks
- poj 3030 Nasty Hacks
- Poj 3030 Nasty Hacks
- poj 3030 Nasty Hacks
- POJ 3030 Nasty Hacks
- POJ 3030 - Nasty Hacks
- poj 3030 水题 Nasty Hacks
- POJ 3030 && HDU 2317 Nasty Hacks(水~)
- Nasty Hacks
- Nasty Hacks
- POJ 3030 Nasty Hacks(我的水题之路——比较大小)
- 2317:Nasty Hacks
- HDU 2317 Nasty Hacks
- HOJ 2453 Nasty Hacks
- HDU2317:Nasty Hacks
- hdu-2317-Nasty Hacks
- Nasty Hacks 2317
- Poj OpenJudge 1068 Parencodings
- Poj 2583 Series Determination
- Poj 2707 Copier Reduction
- Bitmap OOM问题解决及优化
- Poj 2840 Big Clock
- Poj 3030 Nasty Hacks
- Poj 3062 Celebrity jeopardy
- Poj 3117 World Cup
- Poj 3278 Catch That Cow
- Poj 3126 Prime Path
- xcode的快捷键
- Poj OpenJudge 百练 2632 Crashing Robots
- Poj OpenJudge 百练 1573 Robot Motion
- OpenCV学习(14) 细化算法(2)(转)