toj 2483 Nasty Hacks
Time Limit: 0.5 Seconds Memory Limit: 65536K
Total Runs: 969 Accepted Runs: 759
![](https://www.cnblogs.com/forever4444/admin/2483_hacks.png)
Input specifications
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 specifications
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
Output for sample input
advertise does not matter do not advertise
Source: Nordic Collegiate Contest 2006
#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int a,b,c;
cin>>a>>b>>c;
if(b-c==a)
{
cout<<"does not matter"<<endl;
}
else if(b-c>a)
{
cout<<"advertise"<<endl;
}
else
{
cout<<"do not advertise"<<endl;
}
}
return 0;
}
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int a,b,c;
cin>>a>>b>>c;
if(b-c==a)
{
cout<<"does not matter"<<endl;
}
else if(b-c>a)
{
cout<<"advertise"<<endl;
}
else
{
cout<<"do not advertise"<<endl;
}
}
return 0;
}