HDU 1037 Keep on Truckin'(水题)
来源:互联网 发布:windows of the mind 编辑:程序博客网 时间:2024/05/16 06:37
题目传送门:HDU 1037 Keep on Truckin'
题目大意: 给出三个数,若都 >= 168则输出 NO CRASH, 否则 输出第一个小于168的数(小于168的数中最小的, 比如111, 90, 120,就输出CRASH 90);
题解:简单地用sort排个序, 然后用num[0](三个数中最小的)与168进行比较.
#include<iostream>#include<cstdlib>#include<cstdio>#include<algorithm>#include<cmath>#include<map>#include<stack>#include<queue>#include<ctime>#include<cstring>#include<string>#define LL __int64#define INF 0x3f3f3f3f3fusing namespace std;int main(){int i, j, k, n, num[4];while(~scanf("%d%d%d", &num[0], &num[1], &num[2])){sort(num, num+3);if(num[0]>=168) printf("NO CRASH\n");elseprintf("CRASH %d\n", num[0]);}return 0;}
0 0
- hdu 1037 Keep on Truckin'(水题)
- HDU 1037 Keep on Truckin'(水题)
- HDU 1037 Keep on Truckin' 水题
- HDU 1037 Keep on Truckin' (水题)
- HDU 1037 Keep on Truckin'
- HDU 1037 Keep on Truckin'
- hdu-1037-Keep on Truckin'
- hdu 1037 Keep on Truckin'
- hdu 1037 Keep on Truckin'
- HDU 1037 Keep on Truckin'
- HDU 1037 Keep on Truckin'
- HDU 1037 Keep on Truckin'
- hdu-1037 Keep on Truckin'
- hdu 1037 Keep on Truckin'
- HDU 1037Keep on Truckin'
- hdu 1037 Keep on Truckin'
- HDU 1037 Keep on Truckin'
- HDU-1037 Keep on Truckin'
- 【JVM】JVM之类加载器
- AFNetworking 3.0 版本使用
- leetcode32_Longest Valid Parentheses
- eclipse 卡住不动
- PL/SQL 实例总结
- HDU 1037 Keep on Truckin'(水题)
- 第十周项目3----判断二叉树的相似
- JavaScript原生选项卡制作附新浪选项卡案例
- Message no. V1631-You cannot enter new delivery costs
- mysql 中->变成'> 无法结束语句问题
- DSP学习1
- luogu【P1008】三连击
- 蛇形填数
- Python语言:类和对象