Nasty Hacks 2317
来源:互联网 发布:linux udp流量 编辑:程序博客网 时间:2024/05/16 06:54
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: -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>int main(int argc, const char* argv[]){ int nCases = 0; std::cin >> nCases; while (nCases--) { int r = 0, e = 0, c = 0; std::cin >> r >> e >> c; int no = r; int ye = e - c; if (no < ye) { std::cout << "advertise" << std::endl; } else if (no == ye) { std::cout << "does not matter" << std::endl; } else { std::cout << "do not advertise" << std::endl; } } return 0;}
- 2317:Nasty Hacks
- HDU 2317 Nasty Hacks
- hdu-2317-Nasty Hacks
- Nasty Hacks 2317
- hd 2317 Nasty Hacks
- HDU 2317 Nasty Hacks
- HDU-2317-Nasty Hacks
- hdu 2317 Nasty Hacks
- HDOJ 2317 Nasty Hacks
- hdu 2317 Nasty Hacks
- HDOJ 2317 Nasty Hacks(水题)
- Nasty Hacks
- Nasty Hacks
- HDOJ(HDU) 2317 Nasty Hacks(比较、)
- 杭电2317题 Nasty Hacks
- POJ 3030 Nasty Hacks
- poj 3030 Nasty Hacks
- HOJ 2453 Nasty Hacks
- 编程之美初赛第一场 焦距
- go 安装及配置过程
- Hashcode的作用
- django的模型总结
- 转 完成端口(CompletionPort)详解 - 手把手教你玩转网络编程系列之三
- Nasty Hacks 2317
- Installation of NVIDIA Drivers in RHEL/CentOS and Fedora
- 式移动(move)特殊的成员函数(也实现了=default)
- APP-FND-01238
- 祁可欣微博小Q_lady曝光 吉星鹏家暴最终砍死妻子
- delphi客户端+Java服务端
- 该公司myRIO不仅有丰富的硬体生态系统
- HDU-1233 还是畅通工程(最小生成树&并查集)
- leetcode:median of two sorted arrays