hdu1037，1037u

hdu1037，1037u

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 16    

 1 #include"stdio.h"
 2 int main(void)
 3 {
 4     int x;
 5     char ch=1;
 6     int t=0;
 7 
 8     while(scanf("%d",&x)&&ch!='\n')
 9     {
10         ch=getchar();
11         if(x>168)    continue;
12         else        {printf("CRASH %d\n",x);t=1;break;}
13     }
14     if(t==0)    printf("NO CRASH\n");    
15     return 0;
16 }

這道題太水，第一次想用沒學過的C++裝個逼，結果被無情的退回來了，老老實實用C語言就AC了。

題裡有一道小坑，就是每行輸出結束的判斷，這個設計還是很簡單的只要判斷回車符就了闊以了。