HDU 2317 Nasty Hacks
来源:互联网 发布:linux 查看gpu显存 编辑:程序博客网 时间:2024/05/16 08:06
Nasty Hacks
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2299 Accepted Submission(s): 1816
Problem Description
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.
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 40
Sample Output
advertisedoes not matterdo not advertise
Source
Nordic 2006
解题思路:继续水题。直接比较每行的三个数,如果第一个数大于第二个数减去第三个数,则需要做广告;若等于,就无所谓;否则,不做广告。
AC代码:
#include <iostream>#include <cstdio>using namespace std;int main(){//freopen("in.txt", "r", stdin);int n, a, b, c;while(scanf("%d", &n)==1){for(int i=0; i<n; i++){scanf("%d%d%d", &a, &b, &c);if(a < b - c) printf("advertise\n");else if(a == b - c) printf("does not matter\n");else printf("do not advertise\n");}}return 0;}
0 0
- HDU 2317 Nasty Hacks
- hdu-2317-Nasty Hacks
- HDU 2317 Nasty Hacks
- HDU-2317-Nasty Hacks
- hdu 2317 Nasty Hacks
- hdu 2317 Nasty Hacks
- HDOJ(HDU) 2317 Nasty Hacks(比较、)
- Nasty Hacks HDU
- 2317:Nasty Hacks
- Nasty Hacks 2317
- hd 2317 Nasty Hacks
- HDOJ 2317 Nasty Hacks
- POJ 3030 && HDU 2317 Nasty Hacks(水~)
- HDOJ 2317 Nasty Hacks(水题)
- Nasty Hacks
- Nasty Hacks
- 杭电2317题 Nasty Hacks
- POJ 3030 Nasty Hacks
- SICP 1.23-1.26体会
- API---有意思的API
- 程序员是不是真的经常在生活中被绿呢?
- Qt5.2.0到Qt5.3.2的迁移问题
- 在jsp中调用ActiveX控件播放视频
- HDU 2317 Nasty Hacks
- 后台执行oracle sql脚本
- Android LOG记录 & BUG分析
- Revenge of LIS II(HDU 5087)
- 程序猿之---C语言细节1(==与=、函数指针、数组字符串printf、int ((b));、char b =‘abcd’)
- 2014阿里巴巴笔试题
- 大赛计分
- TCP/IP学习笔记(一)
- 关于相对熵(KL距离)的理解