View Code of Problem 1

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <deque>
#include <string>
#include <utility>
#include <functional>

using namespace std;

//------------------
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pw(x) (1ll << (x))
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rep(i, l, r) for(int i = (l);i<r;i++)
#define per(i, l, r) for(int i = r - 1;i>=l;--i)
#define sf(x) scanf("%d", &(x))

const double pi = acos(-1);

void solve() {

}

int main() {
#ifndef ONLINE_JUDGE
	freopen("./std.in", "r", stdin);
	return 0;
#else
	ios_base::sync_with_stdio(false);
	int a, b;
	cin >> a >> b;
	cout << (a + b) << endl;
	return 0;
#endif // !ONLINE_JUDGE
	
	int t;
	cin >> t;
	while (t--)
		solve();
	return 0;
}