hdu1.2.3 Nasty Hacks
来源:互联网 发布:福禄克网络测试仪器 编辑:程序博客网 时间:2024/05/16 08:04
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
import java.io.FileInputStream;import java.io.BufferedReader;import java.io.InputStreamReader;import java.io.PrintWriter;import java.io.OutputStreamWriter;import java.io.StreamTokenizer;public class Main implements Runnable{private static final boolean DEBUG = false;private BufferedReader cin;private PrintWriter cout;private StreamTokenizer tokenizer;private int r, e, c;private void init() {try {if (DEBUG) {cin = new BufferedReader(new InputStreamReader(new FileInputStream("d:\\OJ\\uva_in.txt")));} else {cin = new BufferedReader(new InputStreamReader(System.in));}cout = new PrintWriter(new OutputStreamWriter(System.out));tokenizer = new StreamTokenizer(cin);} catch (Exception e) {e.printStackTrace();}}private String next(){try {tokenizer.nextToken();if (tokenizer.ttype == StreamTokenizer.TT_EOF) return null;else if (tokenizer.ttype == StreamTokenizer.TT_NUMBER) {return String.valueOf((int)tokenizer.nval);} else return tokenizer.sval;} catch (Exception e) {e.printStackTrace();return null;}}private void input() {r = Integer.parseInt(next());e = Integer.parseInt(next());c = Integer.parseInt(next());}private void solve() {if (r < e - c) {cout.println("advertise");} else if (r == e - c) {cout.println("does not matter");} else {cout.println("do not advertise");}cout.flush();}public void run(){init();int t = Integer.parseInt(next());while (t-- > 0) {input();solve();}}public static void main(String[] args) {new Thread(new Main()).start();}}
0 0
- hdu1.2.3 Nasty Hacks
- Nasty Hacks
- Nasty Hacks
- POJ 3030 Nasty Hacks
- poj 3030 Nasty Hacks
- 2317:Nasty Hacks
- HDU 2317 Nasty Hacks
- HOJ 2453 Nasty Hacks
- poj 3030 Nasty Hacks
- HDU2317:Nasty Hacks
- hdu-2317-Nasty Hacks
- Nasty Hacks 2317
- hd 2317 Nasty Hacks
- Nasty Hacks
- HDU 2317 Nasty Hacks
- Poj 3030 Nasty Hacks
- HDU-2317-Nasty Hacks
- HDU2317 Nasty Hacks【水题】
- Buttons in button bars should be borderless; use style="?android:attr/buttonBarButtonStyle" (and ?an
- .NET程序加壳的基本原理和方式浅析
- Android 使用BroadCast实现强制下线功能
- linux 各目录介绍
- JVM中Perm区持续上涨问题
- hdu1.2.3 Nasty Hacks
- 个人机房重构之SqlHelper
- shared_ptr
- 为何linux系统里那么多双下划线命名的函数?
- 华为副总裁徐家骏离职:年薪千万工作感悟十二条
- 关于java加壳和代码混淆
- Linux学习笔记(七)用户和组
- 在centOS6.5下安装flash插件
- [shell]join两个文件