Loading...
Submission
# When Author Problem Language CPU Memory
4468 2022-03-25 19:58:41 The_crawler Max Number C++ 17 5 ms 3444 kb Accepted
Test Cases
# CPU Memory Points
1 2 ms 3336 kb 1 Accepted
2 2 ms 3436 kb 1 Accepted
3 2 ms 3444 kb 1 Accepted
4 2 ms 3336 kb 1 Accepted
5 2 ms 3284 kb 1 Accepted
6 2 ms 3444 kb 1 Accepted
7 5 ms 3336 kb 1 Accepted
Source Code
  1. /* Author: Tazim(The_crawler) */
  2. #include<bits/stdc++.h>
  3. #define ll long long int
  4. #define dec greater<int>()
  5. #define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower);
  6. #define upper(s) transform(s.begin(), s.end(), s.begin(), ::toupper);
  7. #define prow(n) for(auto i:n)cout<<i<<" ";cout<<endl;
  8. #define pcol(n) for(auto i:n)cout<<i<<endl;
  9. #define yes cout<<"YES"<<endl;
  10. #define no cout<<"NO"<<endl;
  11. #define debug(x) cout<<#x<<" = ";_print(x); cout<<endl; /// Debug function
  12. using namespace std; ///****
  13. bool sortbysec(const pair<int, int>& a, const pair<int, int>& b) { return (a.second < b.second); }
  14. template<class T> void _print(T x) { cout << x; }
  15. template<class T> void _print(vector<T>x) { cout << "[ ";for (T i : x)cout << i << " ";cout << "]"; }
  16. template<class T> void _print(set<T>x) { cout << "[ ";for (T i : x)cout << i << " ";cout << "]"; }
  17. template<class T, class V> void _print(pair<T, V>x) { cout << "{" << x.first << "," << x.second << "} "; }
  18. template<class T, class V> void _print(map<T, V>x) { cout << "[ ";for (auto i : x)_print(i);cout << "]"; }
  19. template<class T> void _print(multiset<T>x) { cout << "[ ";for (T i : x)cout << i << " ";cout << "]"; }
  20. /* Hack my code. It's Easy to Read */
  21.  
  22.  
  23. int main() {
  24. ios_base::sync_with_stdio(false);
  25. cin.tie(NULL);
  26. // start
  27. int t;
  28. cin >> t;
  29. while (t--)
  30. {
  31. ll a, b, c;
  32. cin >> a >> b >> c;
  33. cout << max(a, max(b, c)) << endl;
  34. }
  35.  
  36.  
  37. return 0;
  38. }
  39.