HDU 1037.Keep on Truckin'【水水水(重要事情说三遍)】【8月23】【记录】
2015-08-23 17:06
162 查看
Keep on Truckin'
Problem Description
Boudreaux and Thibodeaux are on the road again . . .
"Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by tonight!"
"Don't worry, Thibodeaux, I already checked ahead. There are three underpasses and our 18-wheeler will fit through all of them, so just keep that motor running!"
"We're not going to make it, I say!"
So, which is it: will there be a very messy accident on Interstate 10, or is Thibodeaux just letting the sound of his own wheels drive him crazy?
Input
Input to this problem will consist of a single data set. The data set will be formatted according to the following description.
The data set will consist of a single line containing 3 numbers, separated by single spaces. Each number represents the height of a single underpass in inches. Each number will be between 0 and 300 inclusive.
Output
There will be exactly one line of output. This line will be:
NO CRASH
if the height of the 18-wheeler is less than the height of each of the underpasses, or:
CRASH X
otherwise, where X is the height of the first underpass in the data set that the 18-wheeler is unable to go under (which means its height is less than or equal to the height of the 18-wheeler).
The height of the 18-wheeler is 168 inches.
Sample Input
Sample Output
直接看代码:
另外记录一下最近在HDU A题的情况:
Problem Description
Boudreaux and Thibodeaux are on the road again . . .
"Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by tonight!"
"Don't worry, Thibodeaux, I already checked ahead. There are three underpasses and our 18-wheeler will fit through all of them, so just keep that motor running!"
"We're not going to make it, I say!"
So, which is it: will there be a very messy accident on Interstate 10, or is Thibodeaux just letting the sound of his own wheels drive him crazy?
Input
Input to this problem will consist of a single data set. The data set will be formatted according to the following description.
The data set will consist of a single line containing 3 numbers, separated by single spaces. Each number represents the height of a single underpass in inches. Each number will be between 0 and 300 inclusive.
Output
There will be exactly one line of output. This line will be:
NO CRASH
if the height of the 18-wheeler is less than the height of each of the underpasses, or:
CRASH X
otherwise, where X is the height of the first underpass in the data set that the 18-wheeler is unable to go under (which means its height is less than or equal to the height of the 18-wheeler).
The height of the 18-wheeler is 168 inches.
Sample Input
180 160 170
Sample Output
CRASH 160
直接看代码:
#include<cstdio> int main(){ int a,b,c,minx,maxn; while(scanf("%d%d%d",&a,&b,&c)==3){ minx=a>b?b:a; minx=minx>c?c:minx; if(minx<168) printf("CRASH %d\n",minx); else printf("NO CRASH\n"); } return 0; }
另外记录一下最近在HDU A题的情况:
相关文章推荐
- ListView自定义itemView
- HawkEye鹰眼系统 高级渗透测试必备利器(SQL/XXE/SSRF神器)
- noip2006初赛-完善程序第二题
- Eclipse的maven插件最新地址
- 再述设计模式——基础知识
- hdu4671 思维构造
- DbUtils 笔记
- 例题 7-5 困难的串 UVa129
- mysql 触发器。
- 不显示控制台 静默运行
- Maven POM学习笔记之<Project>元素
- 在安装数据库中遇到的问题:
- Java 进程通信
- 数据库技术之死锁的实例和监测
- Android学习之解决ListView中item点击事件和item中Button点击事件冲突问题
- 确定两串乱序同构
- orcad统计管脚数
- 项目修改名字后web.xml 报错
- Android而一个超级漂亮的日历控件
- XML预览