HDU1037 - Keep on Truckin' (简单题)
来源:互联网 发布:fifa18球员数据查询 编辑:程序博客网 时间:2024/05/16 11:25
题目链接
- 思路
- 代码
思路
这是一道英语阅读题
代码
#include <cstdio>using namespace std;int main(){ int a, b, c; scanf("%d%d%d", &a, &b, &c); if(a<168) printf("CRASH %d\n", a); else if(b<168) printf("CRASH %d\n", b); else if(c<168) printf("CRASH %d\n", c); else printf("NO CRASH\n"); return 0;}
0 0
- HDU1037 - Keep on Truckin' (简单题)
- HDU1037:Keep on Truckin'
- hdu1037 Keep on Truckin'
- hdu1037 Keep on Truckin'
- hdu1037 Keep on Truckin'(C语言)
- UVALive2857 POJ2578 HDU1037 ZOJ2186 Keep on Truckin'【水题】
- 杭电1037——Keep on Truckin'(简单题)
- hdu 1037 Keep on Truckin'(水题)
- POJ 2578 Keep on Truckin'(水题)
- hdoj 1037 Keep on Truckin'(zz)
- HDU 1037 Keep on Truckin' (水题)
- Keep on Truckin'
- Keep on Truckin'
- 1037 Keep on Truckin'
- Keep on Truckin'
- Keep on Truckin
- 2186:Keep on Truckin'
- Keep on Truckin'
- linux service命令
- Overview: (1)Data Structure: Interval Tree and Poj3264
- CSS文本属性(上)
- CCF-相反数-201403-1
- 二叉树的深度
- HDU1037 - Keep on Truckin' (简单题)
- 异常处理(try catch)
- 程序员养成记
- 提高django model效率的几个小方法
- [LinkerScript.1] 基本的链接器脚本概念 - Basic Linker Script Concepts
- 使用qsort进行字符串数组排序
- DIR 命令 详解
- CCF-出现次数最多的数-201312-1
- 【dfs+回溯】hdu 2553 N皇后问题