2 shunfurh shunfurh 于 2017.09.08 16:44 提问

Nasty Hacks

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.

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
3
0 100 70
100 130 30
-100 -70 40

Sample Output
advertise
does not matter
do not advertise

2个回答

caozhy
caozhy   Ds   Rxr 2017.09.24 08:32
已采纳
fight_in_dl
fight_in_dl   Ds   Rxr 2017.09.09 06:41
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
HDU 2317 Nasty Hacks
Nasty Hacks Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1148    Accepted Submission(s): 929 Problem Description You are the CEO o
Nasty Hacks
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 thei
HUD1.2.4 Nasty Hacks
又是一道超级水的小学数学题···感觉杭电的这个难度安排有点奇怪呀 #include #include #include #include using namespace std; int main() { int n; cin>>n; while(n--){ int r,e,c; scanf("%d%d%d",&r,&e,&c); if(r>e-c) print
HDU 2317 Nasty Hacks
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
hdu 2317 Nasty Hacks
题意:不做广告的收入是 r ,做广告的收入是 e - c (预期收入-广告费),水题不解释。。。 #include using namespace std; int main(){ int n,r,e,c; cin>>n; while(n--){ cin>>r>>e>>c; if(r>e-c){ cout<
POJ 3030 - Nasty Hacks
DescriptionYou 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 produ
HDU2317:Nasty Hacks
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
hd 2317 Nasty Hacks
Nasty HacksTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2147    Accepted Submission(s): 1696 Problem DescriptionYou are the CEO of Nas
Poj 3030 Nasty Hacks
1.Link: http://poj.org/problem?id=3030 2.Content: Nasty Hacks Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 12350   Accepted: 8537 Description You are
POJ3030——Nasty Hacks
Nasty Hacks Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 13634   Accepted: 9460 Description You are the CEO of Nasty Hacks Inc., a company that creates