打擂法
#include<bits/stdc++.h> using namespace std; int a[1000][1000]; int main() { int a,b,c,maxn; cin >> a >> b >> c; maxn=INT_MIN; //开始打擂 if(a>maxn) maxn=a; if(b>maxn) maxn=b; if(c>maxn) maxn=c; cout << maxn << endl; //so easy
By signing up a CZOJ universal account, you can submit code and join discussions in all online judging services provided by us.
Using your CZOJ universal account