HDU 1037Keep on Truckin'

最新推荐文章于 2018-01-06 15:30:36 发布

LIcker丶D

最新推荐文章于 2018-01-06 15:30:36 发布

阅读量225

点赞数

分类专栏： C/C++---OJ题解析文章标签： HDU 1037Keep on Truc

本文链接：https://blog.csdn.net/hfdjfd/article/details/50851210

版权

C/C++---OJ题解析专栏收录该内容

14 篇文章 0 订阅

订阅专栏

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

HDU水群，找一个数比168小的，就输出出来；

#include<stdio.h>
int main()
{
	int a[4],k=0;
	for(int i=0;i<3;i++){		
		scanf("%d",&a[i]);
		if(a[i]<168){
			printf("CRASH %d\n",a[i]);
			k++;
		}				
	}
	if(k==3)
	printf("NO CRASH\n");
 }