Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.007 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.007 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#include <bits/stdc++.h> #define fi first #define se second #define forn(i,n) for(int i=0; i< (int)n; ++i) #define for1(i,n) for(int i=1; i<= (int)n; ++i) #define fore(i,l,r) for(int i=(int)l; i<= (int)r; ++i) #define ford(i,n) for(int i=(int)(n) - 1; i>= 0; --i) #define fored(i,l,r) for(int i=(int)r; i>= (int)l; --i) #define pb push_back #define el '\n' #define d(x) cout<< #x<< " " << x<<el #define ri(n) scanf("%d",&n) #define sz(v) ((int)v.size()) #define all(v) v.begin(),v.end() #define allr(v) v.rbegin(),v.rend() using namespace std; typedef long long ll; typedef double ld; typedef pair<int,int> ii; typedef pair<char,int> pci; typedef tuple<int, int, int> tiii; typedef pair<ll,ll> pll; typedef vector<int> vi; const ll inf = 1e18; const int nax = 1e5+200; const double mpi = acos(-1); const double eps= 1e-10; int dr[] = {1,-1,0, 0,1,-1,-1, 1}; // trick to explore an implicit 2D grid int dc[] = {0, 0,1,-1,1, 1,-1,-1}; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout<< setprecision(20)<< fixed; ll a, b; cin>> a>> b; cout<< a+b<<el; }