Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
1714 | 2021-07-09 23:19:18 | ewu_kick_off_user_32 | Max Number | C++ 11 | 4 ms | 3448 kb | Wrong Answer - 7 |
Source Code
#include <iostream> #include <algorithm> #include <math.h> #include <vector> typedef long long ll; typedef long long int lli; typedef long double ld; int mina = 0x3f3f3f3f; int maxa=0; long long int maxi=0; int arra[10000000]; using namespace std; int main() { /* #ifndef Navid freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); #endif*/ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //Starting Main Code lli n; cin>>n; while(n--){ long long int array[3]; for(lli i=0;i<3;i++){ lli x; cin>>x; maxi=max(x,maxi); } } cout<<maxi<<endl; return 0; }