ZOJ 2186 Keep on Truckin'

最新推荐文章于 2018-12-01 18:43:47 发布

原创最新推荐文章于 2018-12-01 18:43:47 发布 · 597 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#crash #each #less #numbers #input #go

ZOJ ACM 初级题110题专栏收录该内容

59 篇文章

订阅专栏

本文深入探讨了Boudreaux和Thibodeaux在运输泥虫到Baton Rouge过程中遇到的挑战，重点分析了18轮卡车通过三个不同高度的隧道时的车辆高度限制问题。通过具体的输入数据，文章详细解释了如何判断是否会发生碰撞事故，并提供了代码实现。此案例不仅展示了逻辑判断和条件语句的应用，还强调了实际问题解决中数据处理的重要性。

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,找出比168小的数字

代码：

#include <stdio.h>

int main()
{
int a[3];
scanf("%d%d%d",&a[0],&a[1],&a[2]);
int i;
for(i=0;i<3;i++)
{
if(a[i]<=168)
{
printf("CRASH %d\n",a[i]);
return 0;
}
}
printf("NO CRASH\n");
return 0;
}