版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/tobe_numberone/article/details/89057834
题目链接:https://nanti.jisuanke.com/t/T1044
算法特工队QQ群:979618872 (伸手党绕边,欢迎有良好基础的人加入)
//
// Created by Leo Lee on 2019/4/5.
//
#include <iostream>
using namespace std;
int main(){
int max = INT32_MIN,tmp;
for(int i = 0;i<3;i++){
cin>>tmp;
if(tmp>max)max = tmp;
}
cout<<max<<endl;
return 0;
}