2317:Nasty Hacks

最新推荐文章于 2016-12-22 20:09:52 发布

原创最新推荐文章于 2016-12-22 20:09:52 发布 · 806 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#input #integer #each #c

C++ 同时被 2 个专栏收录

149 篇文章

订阅专栏

ACM

14 篇文章

订阅专栏

本文探讨了NastyHacksInc.如何利用算法来决定是否为产品进行广告宣传，以最大化利润。通过比较广告前后的预期收益，算法帮助公司做出最优决策。

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

代码如下：

//acm 2317:Nasty Hacks
#include <iostream>
using namespace std;

int main()
{
	int T,r,e,c;
	cin >> T;
	while (T--)
	{
		cin >> r >> e >> c;
		if (r < e - c)
			cout << "advertise" << endl;
		else 
			if(r == e - c)
				cout << "does not matter" << endl;
			else
				cout << "do not advertise" << endl;
	}

	return 0;
}