ZOJ Problem Set - 2186 Keep on Truckin'【模拟】

快来打我* 2022-08-18 13:28 18阅读 0赞

Keep on Truckin'

--------------------

Time Limit: 2 Seconds  Memory Limit: 65536 KB

--------------------

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

--------------------

解题思路：

找到第一个小于等于168的数输出，如果没有找到就输出NO CRASH。

#include<stdio.h>
    #include<string.h>
    #include<algorithm>
     using namespace std;
     int main()
     {
     	int a,b,c;
     	while(scanf("%d%d%d",&a,&b,&c)!=EOF)
     	{
     		if(a<=168)
     		{
     			printf("CRASH %d\n",a);
     			continue;
     		}
     		if(b<=168)
     		{
     			printf("CRASH %d\n",b);
     			continue;
     		}
     		if(c<=168)
     		{
     			printf("CRASH %d\n",c);
     			continue;
     		}
     		printf("NO CRASH\n");
     	}
     	return 0;
     }