• HDU-1037(水水水题)


    Keep on Truckin'

    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 160
     
     
    分析:无脑判断。
     
     1 #include<cstdio>
     2 #include<cstring>
     3 #include<cstdlib>
     4 #include<iostream>
     5 using namespace std;
     6 int main()
     7 {
     8     int a,b,c;
     9     scanf("%d%d%d",&a,&b,&c);
    10     if(a<=168) printf("CRASH %d
    ",a);
    11     else if(b<=168) printf("CRASH %d
    ",b);
    12     else if(c<=168) printf("CRASH %d
    ",c);
    13     else printf("NO CRASH
    ");
    14     return 0;
    15 }
  • 相关阅读:
    BZOJ 2038 小Z的袜子 莫队算法
    POJ 3407 球面距离
    POJ 1375 圆的切线
    BZOJ 1502 月下柠檬树 simpson积分
    UVA 11704
    POJ 1981 定长圆覆盖最多点
    HDU 3982 半平面交+圆和凸多边形面积并
    ZOJ 1104 二分
    使用Singleton来实现Flash和Flex的通信。
    校内API相关
  • 原文地址:https://www.cnblogs.com/RRirring/p/4711681.html
Copyright © 2020-2023  润新知