HDOJ 2317 Nasty Hacks



Nasty Hacks

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2884    Accepted Submission(s): 2252

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

 

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
   
   
   
   

 

无意间点开了好声音，没停下来，QAQ，早上的周赛肯定跪了。。。

说的每晚回来一道ACM  Step就睡呢？QAQ。。。

还在第一关，依旧水题，代码如下：

#include<cstdio>
int main()
{
	int n,r,e,c;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%d%d%d",&r,&e,&c);
		if(e-c>r)
		   printf("advertise\n");
		else if(e-c==r)
		   printf("does not matter\n");
		else
		   printf("do not advertise\n");
	}
	return 0;
}