Pagini recente » Cod sursa (job #2432402) | Cod sursa (job #29364) | Cod sursa (job #813490) | Cod sursa (job #378806) | Cod sursa (job #2239488)
#include <iostream>
#include <cstdio>
#include <vector>
#include <fstream>
using namespace std;
typedef pair< int, int > pii;
typedef pair< long long, long long > pll;
typedef long long ll;
typedef vector< int > vi;
typedef vector< ll > vll;
typedef vector< pii > vpii;
typedef long double ld;
ll lgput(ll a, ll b, ll mod) {
ll ret = 1;
while( b ){
if(b & 1) ret = (ret * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ret;
}
int binarySearch(vector< int > &v, int value) {
int best = 0;
for(int step = 29; step >= 0; --step) {
if(best + (1<<step) < v.size() && v[best + (1<<step)] <= value) best += (1<<step);
}
return best;
}
ifstream f("adunare.in");
ofstream g("adunare.out");
int main() {
ios::sync_with_stdio(false);
int a, b;
f >> a >> b;
g << a + b;
return 0;
}