博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
POJ 3030 Nasty Hacks(我的水题之路——比较大小)
阅读量:4070 次
发布时间:2019-05-25

本文共 1912 字,大约阅读时间需要 6 分钟。

Nasty Hacks
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 9214   Accepted: 6478

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, re 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 ≤re ≤ 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

给三个数字,r,e,c,
1)如果e - c > r,则输出“advertise”;
2)如果e - c == r,则输出“does not matter”;
3)如果e - c < r,则输出“do not advertise”。
水到让人生都觉得无望啊!!
代码(1AC):
#include 
#include
#include
int main(void){ int ii, casenum; int r, e, c; scanf("%d", &casenum); for (ii = 0; ii < casenum; ii++){ scanf("%d%d%d", &r, &e, &c); if (e - c > r){ printf("advertise\n"); } else if (e - c == r){ printf("does not matter\n"); } else{ printf("do not advertise\n"); } } return 0;}

转载地址:http://cloji.baihongyu.com/

你可能感兴趣的文章
linux内核内存管理(zone_dma zone_normal zone_highmem)
查看>>
将file文件内容转成字符串
查看>>
循环队列---数据结构和算法
查看>>
优先级队列-数据结构和算法
查看>>
链接点--数据结构和算法
查看>>
servlet中请求转发(forword)与重定向(sendredirect)的区别
查看>>
Spring4的IoC和DI的区别
查看>>
springcloud 的eureka服务注册demo
查看>>
eureka-client.properties文件配置
查看>>
MODULE_DEVICE_TABLE的理解
查看>>
platform_device与platform_driver
查看>>
platform_driver平台驱动注册和注销过程(下)
查看>>
.net强制退出主窗口的方法——Application.Exit()方法和Environment.Exit(0)方法
查看>>
c# 如何调用win8自带的屏幕键盘(非osk.exe)
查看>>
build/envsetup.sh 简介
查看>>
C++后继有人——D语言
查看>>
Android framework中修改或者添加资源无变化或编译不通过问题详解
查看>>
linux怎么切换到root里面?
查看>>
linux串口操作及设置详解
查看>>
安装alien,DEB与RPM互换
查看>>