POJ 1504 解题报告

/*
ID: thestor1
LANG: C++
TASK: poj1504
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

int reverse(int num)
{
int r = 0;
while (num > 0)
{
r = r * 10 + num % 10;
num /= 10;
}
return r;
}

int main()
{
int N;
scanf("%d", &N);

for (int i = 0; i < N; ++i)
{
int num1, num2;
scanf("%d%d", &num1, &num2);
printf("%d\n", reverse(reverse(num1) + reverse(num2)));
}

return 0;
}