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<<"do not advertise"<
Nasty Hacks
討厭的黑客
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2863 Accepted Submission(s): 2233
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.
輸入包含多組測試事件，第一行是一個正整數n，
The next n lines each contain 3 integers, r, e and c.
接下來的n行都有3個整數， r , e , c 這三個字符；
The first, r, is the expected revenue if you do not advertise,
如果你不做廣告，r 表示預期收益；
the second, e, is the expected revenue if you do advertise, and the third, c, is the cost of advertising.
如果你做廣告，e 表示預期收益，c 表示廣告費用。
You can assume that the input will follow these restrictions:-106 ≤ r, e ≤ 106 and 0 ≤ c ≤ 106.
你可以認為輸入的數據在如下范圍內，-106 ≤ r，e ≤ 106 and 0 ≤ c ≤ 106 。
Output
Output one line for each test case: “advertise”, “do not advertise” or “does not matter”,
每一個測試事件，在單獨的一行輸出結果。“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.
提出r,e,c這三者哪一個是最有利的。
Sample Input3
0 100 70
100 130 30
-100 -70 40
Sample Output
advertise
does not matter
do not advertise
Source Nordic 2006
