toj 2483 Nasty Hacks

本文介绍了一个关于是否通过广告提升销售额的问题。输入包括不打广告和打广告的预期收益及广告成本,通过比较来决定最佳策略。文章提供了一个简单的C++实现案例。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

2483.   Nasty Hacks
Time Limit: 0.5 Seconds    Memory Limit: 65536K
Total Runs: 969    Accepted Runs: 759



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 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: -106r, 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
Submit   List    Runs   Forum   Statistics

#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 ;
}

转载于:https://www.cnblogs.com/forever4444/archive/2009/05/20/1471199.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值