日韩久久久精品,亚洲精品久久久久久久久久久,亚洲欧美一区二区三区国产精品 ,一区二区福利

問題一百二十七:Keep on Truckin

系統(tǒng) 2275 0

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 inclusive.

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
    
  
  
    #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 %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;

}
  
    
  
    
      問題一百二十七:Keep on Truckin
    
  

問題一百二十七:Keep on Truckin


更多文章、技術(shù)交流、商務(wù)合作、聯(lián)系博主

微信掃碼或搜索:z360901061

微信掃一掃加我為好友

QQ號(hào)聯(lián)系: 360901061

您的支持是博主寫作最大的動(dòng)力,如果您喜歡我的文章,感覺我的文章對(duì)您有幫助,請(qǐng)用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧,狠狠點(diǎn)擊下面給點(diǎn)支持吧,站長(zhǎng)非常感激您!手機(jī)微信長(zhǎng)按不能支付解決辦法:請(qǐng)將微信支付二維碼保存到相冊(cè),切換到微信,然后點(diǎn)擊微信右上角掃一掃功能,選擇支付二維碼完成支付。

【本文對(duì)您有幫助就好】

您的支持是博主寫作最大的動(dòng)力,如果您喜歡我的文章,感覺我的文章對(duì)您有幫助,請(qǐng)用微信掃描上面二維碼支持博主2元、5元、10元、自定義金額等您想捐的金額吧,站長(zhǎng)會(huì)非常 感謝您的哦?。?!

發(fā)表我的評(píng)論
最新評(píng)論 總共0條評(píng)論
主站蜘蛛池模板: 类乌齐县| 南京市| 白河县| 梓潼县| 雅江县| 彭泽县| 怀化市| 天气| 商都县| 乌拉特前旗| 山丹县| 武强县| 略阳县| 茶陵县| 长宁区| 通渭县| 苍南县| 西畴县| 洪泽县| 且末县| 延吉市| 平利县| 民乐县| 休宁县| 石台县| 松潘县| 沙湾县| 鄂温| 巴彦淖尔市| 准格尔旗| 邵阳市| 什邡市| 蓝田县| 砀山县| 焉耆| 安义县| 沛县| 股票| 贵阳市| 连云港市| 巴彦淖尔市|