Nasty Hacks |
| Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
| Total Submission(s): 2047 Accepted Submission(s): 1280 |
|
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 |
|
Sample Output
advertise |
代码：
#include<stdio.h>
int main(void)
{
int n;
long a[3],t;
scanf("%d",&n);
while(n--)
{
scanf("%ld%ld%ld",&a[0],&a[1],&a[2]);
t=a[1]-a[0];
if(t>a[2]) printf("advertise\n");
else if(t==a[2]) printf("does not matter\n");
else printf("do not advertise\n");
}
}
注：使用while循环时应注意“循环结束”问题，不然会出现提交错误，如Output Limit Exceeded（超时）。