Question one hundred and twenty-seven: Keep on Truckin

Source: Internet
Author: User

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 multiple data sets. Each 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 random Sive.

The data sets end with a negetive integer.


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 smallest 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
-1
Sample Output


CRASH 160
[Plain]
# Include <stdio. h>
Int main (){
Int I;
Int j;
Int t;
Int flag;
Int num [3];
While (scanf ("% d", & num [0])! = EOF & num [0]> = 0)
{Scanf ("% d", & num [1], & num [2]);
Flag = 0;
For (I = 0; I <2; I ++)

{For (j = I + 1; j <3; j ++)
{
If (num [I]> num [j])
{T = num [I];
Num [I] = num [j];
Num [j] = t;
}}
} For (I = 0; I <3; I ++)
{If (num [I] <= 168)
{Flag = 1;
Break;
}
} If (flag)
{Printf ("CRASH % d \ n", num [I]);
} Else
{Printf ("no crash \ n ");
} Return 0; }# include <stdio. h>

Int main ()
{
Int I;
Int j;
Int t;
Int flag;
Int num [3];

While (scanf ("% d", & num [0])! = EOF & num [0]> = 0)
{
Scanf ("% d", & num [1], & num [2]);

Flag = 0;

For (I = 0; I <2; I ++)
{
For (j = I + 1; j <3; j ++)
{
If (num [I]> num [j])
{
T = num [I];
Num [I] = num [j];
Num [j] = t;
}
}
}

For (I = 0; I <3; I ++)
{
If (num [I] <= 168)
{
Flag = 1;
Break;
}
}

If (flag)
{
Printf ("CRASH % d \ n", num [I]);
}
Else
{
Printf ("no crash \ n ");
}
}

Return 0;
}

 

 

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.