hdu 2317
来源:互联网 发布:手机音频分析软件 编辑:程序博客网 时间:2024/06/12 01:48
Nasty Hacks
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1337 Accepted Submission(s): 1084
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.
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: -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
30 100 70100 130 30-100 -70 40
Sample Output
advertisedoes not matterdo not advertise
Source
Nordic 2006
Recommend
zty
#include <stdio.h>int main(){int n, r, e, c;scanf("%d", &n);while (n--){scanf("%d%d%d", &r, &e, &c);if(r < e - c)printf("advertise\n");else if(r == e - c)printf("does not matter\n");elseprintf("do not advertise\n");}return 0;}
- hdu 2317
- hdu-2317
- HDU 2317 Nasty Hacks
- hdu-2317-Nasty Hacks
- HDU 2317 Nasty Hacks
- HDU-2317-Nasty Hacks
- hdu 2317 Nasty Hacks
- hdu 2317 Nasty Hacks
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- 源代码管理十诫
- VMware vSphere 5虚拟数据中心构建指南
- 每个国家/地区的google网站
- 将HTML input file的文件选择路径清空
- .net内存管理
- hdu 2317
- 基于内容的多媒体和跨媒体信息检索技术
- for循环与foreach性能比较
- UIScrollView 原理
- android:tag与android:id的区别
- 在C#程序中实现插件架构
- URI和URL的区别
- JS 、 jquery心得
- 需求分析-如何进行软件需求分析