题目链接:http://poj.org/problem?id=2602
思路:
每个位数相加,大于9就进位,题目不难,比较有意思的是输入输出的问题;如果你求出来的数用数组存着,然后一个一个的输出,从估算的时间上看,好像很充裕,但事实上一定会超时,哪怕用scanf和prinrf,可以看看这题在discuss情况,解决方法就是把他存在一个char数组里,然后输出的时候直接printf("%s") 就行了,尽管这样,花费的时间还是很大;
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
#include<map>
#include<stack>
#include<sstream>
#include<vector>
#include<string>
#include<set>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define REP(i,n) for(int i=0;i<n;++i)
int read(){
int r=0,f=1;char p=getchar();
while(p>'9'||p<'0'){if(p=='-')f=-1;p=getchar();}
while(p>='0'&&p<='9'){r=r*10+p-48;p=getchar();}return r*f;
}
typedef long long ll;
typedef unsigned long long ull;
const int Maxn = 1e6+10;
const long long LINF = 1e18;
const int INF = 0x3f3f3f3f;
const int Mod = 1e6+7;
const double PI = acos(-1.0);
int a[Maxn],b[Maxn];
char ans[Maxn];
int main (void)
{
int n;
while(scanf("%d",&n) != EOF) {
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for (int i = n-1; i >= 0; --i) {
scanf("%d%d",&a[i],&b[i]);
}
int cnt = n-1;
for (int i = 0; i < n; ++i) {
a[i]+=b[i];
if(a[i] > 9) {
a[i+1]+=a[i]/10;
a[i]%=10;
}
ans[cnt--] = (char)(a[i]+'0');
}
ans[n] = '\0';
printf("%s\n",ans);
}
return 0;
}