Loading...
Submission
# When Author Problem Language CPU Memory
20158 2024-05-20 15:59:01 r_ony A Plus B C++ 17 1 ms 3552 kb Wrong Answer - 1
Test Cases
# CPU Memory Points
1 1 ms 3552 kb 0 Wrong Answer
2 0 ms 0 kb 0 Skipped
3 0 ms 0 kb 0 Skipped
4 0 ms 0 kb 0 Skipped
5 0 ms 0 kb 0 Skipped
6 0 ms 0 kb 0 Skipped
Source Code
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define fastio ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
  4. #define yes cout<<"YES"<<'\n'
  5. #define no cout<<"NO"<<'\n'
  6. #define tc int t;cin>>t;while(t--)
  7. #define vl vector<long long>
  8. #define vi vector<int>
  9. #define vc vector<char>
  10. #define vs vector<string>
  11. #define ll long long int
  12. #define ul unsigned long long int
  13. #define vpi vector<pair<int,int>>
  14. #define vpl vector<pair<ll,ll>>
  15. #define endl '\n'
  16. #define nl cout<<endl;
  17. #define PI acos(-1.0)
  18. #define all(v) v.begin(),v.end()
  19. #define inv(v,n) vi v(n);for(auto &it:v) cin>>it
  20. #define coutv(v) for(auto it:v)cout<<it<<' ';cout<<endl;
  21. #define srt(v) sort(v.begin(),v.end())
  22. #define rvs(v) reverse(v.begin(),v.end())
  23. #define rsrt(v) sort(v.rbegin(),v.rend())
  24. #define nai cout<<-1<<endl
  25. #define pb push_back
  26.  
  27. ll Pow(int n){
  28.  
  29. ll x=1;
  30. for(int i=0;i<n;i++){
  31. x*=2;
  32. }
  33. return x;
  34. }
  35.  
  36. void solve(){
  37.  
  38. int n,m;
  39. cin>>n>>m;
  40.  
  41. // int a[n];
  42.  
  43. // for(int i=0;i<n;i++) cin>>a[i];
  44. // sort(a,a+n);
  45.  
  46. // cout<<a[0]<<' ';
  47.  
  48. cout<<n+m<<endl;
  49. }
  50.  
  51.  
  52. int main(){
  53.  
  54. #ifndef ONLINE_JUDGE
  55. freopen("input.txt", "r", stdin);
  56. freopen("output.txt", "w", stdout);
  57. #endif
  58.  
  59. fastio;
  60.  
  61. // int t; cin>>t;
  62.  
  63. // for(int zz=0;zz<t;zz++){
  64. // cout<<"Case "<<zz+1<<':'<<endl;
  65. // solve();
  66. // }
  67.  
  68. //tc
  69. solve();
  70.  
  71.  
  72. }