Nasty Hacks

最新推荐文章于 2020-05-20 17:30:13 发布

原创最新推荐文章于 2020-05-20 17:30:13 发布 · 629 阅读

0 ·

CC 4.0 BY-SA版权

ACM 专栏收录该内容

15 篇文章

订阅专栏

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

30 100 70100 130 30-100 -70 40

Sample Output

advertisedoes not matterdo not advertise

#include <iostream>
using namespace std;
int main()
{
	int a,r,e,c;
	cin>>a;
	while (a>0)
	{
		cin>>r>>e>>c;
		if (e>r+c)
			cout<<"advertise"<<endl;
		else if (e==(r+c))
			cout<<"does not matter"<<endl;
		else cout<<"do not advertise"<<endl;
		--a;
	}
	system("pause");
	return 0;
}