The hardest problem
来源:互联网 发布:js中get post 区别 编辑:程序博客网 时间:2024/06/06 12:45
Description
In the final exam, you are given n problems to solve, each one of which has an integer value indicating its difficulty, the larger, the harder. You need to find out which problem is the hardest.
Input
Input may contain several test cases, one per line. For each test case, the first integer indicates n (1<=n<=4), the number of problems. And then n signed 32-bit integers follow. A case with n=0 indicates the end of input, which should not be processed.
Output
For each test case, you must output the difficulty value of the hardest problem in a single line.
//1157. The hardest problem#include <iostream>#include <cstdio>using namespace std ;int main (){long long test = 0 , hard_level = 0 ;while (cin >> test && test != 0){long long hardest ;cin >> hardest ;for (int i = 0 ; i < test - 1; ++i){cin >> hard_level ;if(hardest - hard_level < 0 ){hardest = hard_level ;}}cout << hardest << endl ;}return 0 ;}
0 0
- The Hardest Problem Ever
- The Hardest Problem Ever
- 1157. The hardest problem
- The Hardest Problem Ever
- 1157[The hardest problem]
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- SOJ.The hardest problem
- The Hardest Problem Ever
- The hardest problem
- The Hardest Problem Ever
- 1157. The hardest problem
- 1157. The hardest problem
- [c] sdnuoj1147Pythagoras's Revenge
- hdoj-2066 一个人的旅行【最短路径--dijkstra&&spfa&&floyd】
- C# LinkedList<T> 泛型类的实现
- FZU 2135 数字游戏
- 多线程 - 07.GCD函数和队列组合示例
- The hardest problem
- 【C++】复数类
- 软件架构的道德责任
- 动画
- 常用传感器协议6:中立格林VOC传感器
- BUG与异常小结
- uva 10652 - Board Wrapping(凸包)
- ssh常见错误
- 解决XCODE配置LLVM环境出现的问题