AcmStep Chapter One Section Two—Nasty Hacks
2011-08-17 15:07
363 查看
Problem Description
You are the CEO of Nasty Hacks Inc., a company that creates small pieces of malicious software which teenagers may useto 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 revenueif 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.#include <iostream> using namespace std; int main() { int n; cin>>n; while (n--) { int a,b,c,d; cin>>a>>b>>c; d=b-c; if (d<a) cout<<"do not advertise"<<endl; else if (d==a) cout<<"does not matter"<<endl; else cout<<"advertise"<<endl; } return 0; }
这或者只是一个幼稚的起步,但希望路过的大牛可以指点一二,从各方面都可以,包括编程风格等。
相关文章推荐
- Acm Step Chapter One Section Two—Rightmost Digit
- AcmStep Chapter One Section Two—Climbing Worm
- HDU acm step:Chapter one section three(简单贪心)
- AcmStep Chapter One Section One—A+B problem series
- HDU's ACM Step Section One -- A+B for Input-Output Practice
- WCF 4 Step By Step Chapter 10-12 Note (Reliable Sessions,ProgrammaticallyControlling, One-Way ...)
- UESTC_One Step Two Steps CDOJ 1027
- ACM STEPS——Chapter Two——Section One
- ACM Steps Chapter One
- Memory space manipulating in Java(Section two:Process Memory Model on AIX part one-Terminologies)
- hdu ACM Step chapter 2
- chapter 2 section 2.4 The Tamworth Two
- [Objective-c基础教程] chapter one Before You Start & chapter two Extensions to C
- ACMSTEP 1.2.5 IBM Minus One//超级水题
- 杭电 ACM Chapter One
- (Step one)利用JAVA进行XML编程
- USACO-Section 2.4 The Tamworth Two(模拟)
- hdu ACM step 1.2.1 hdu1049
- ACM STEP 1.2.7 Lowest Bit
- csharp:Compare two DataTables to rows in one but not the other