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 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 product and it is time to wait 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 demo-as to whether you shoshould advertise or not, given the expected revenues.

 
Inputthe 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.
Outputoutput 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

30 100 70100 130 30-100 -70 40

 
Sample output

advertisedoes not matterdo not advertise

 
Sourcenordicc 2006

Solution: Continue to solve the problem. Directly compare the three numbers in each row. If the first number is greater than the second number minus the third number, advertisement is required. If the first number is equal, it doesn't matter. Otherwise, no advertisement is performed.

AC code:

#include <iostream>#include <cstdio>using namespace std;int main(){//freopen("in.txt", "r", stdin);int n, a, b, c;while(scanf("%d", &n)==1){for(int i=0; i<n; i++){scanf("%d%d%d", &a, &b, &c);if(a < b - c) printf("advertise\n");else if(a == b - c)  printf("does not matter\n");else  printf("do not advertise\n");}}return 0;}

HDU 2317 nasty hacks