1677. Nasty Hacks

单点时限: 2.0 sec

内存限制: 256 MB

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.


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: -10^6 ≤ r, e ≤ 10^6 and 0 ≤ c ≤ 10^6.


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.


0 100 70
100 130 30
-100 -70 40
does not matter
do not advertise

136 人解决,138 人已尝试。

144 份提交通过,共有 199 份提交。

1.4 EMB 奖励。

创建: 16 年,9 月前.

修改: 6 年,9 月前.

最后提交: 3 月,4 周前.

来源: Nordic 2006