设置是否广告问题

本文探讨了如何根据输入参数判断是否进行广告宣传,并通过输出决策来实现最优收益。算法适用于商业策略制定。

问题:

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: -106 ≤ r, e ≤ 106 and 0 ≤ c ≤ 106. 


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

回答:

#include<iostream>  
using namespace std;  
int main()  
{  
    int t,r,e,c;  
    while(scanf("%d",&t)!=EOF)  
    {  
        while(t--)  
        {  
            scanf("%d%d%d",&r,&e,&c);  
            if(r>(e-c))printf("do not advertise\n");  
            else if(r<(e-c))printf("advertise\n");  
            else printf("does not matter\n");  
        }  
 
    }  
    return 0;  
}

转载于:https://www.cnblogs.com/benchao/p/4494848.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值