POJ 1503

#include <iostream>
#include <string>
#define MAXN 100000
using namespace std;

//string _s[MAXN];
int ans[MAXN];

int main()
{
//freopen("acm.acm","r",stdin);
string s;
int i;
int index;
memset(ans,0,sizeof(ans));
index = 0;
while(cin>>s,s != "0")
{
for(i = s.length()-1; i >= 0; -- i)
{
ans[index ++] += s[i]-'0';
}
index = 0;
}
int c;
int tem;
c = 0;
for(i = 0; i < MAXN; ++ i)
{
ans[i] += c;
c = ans[i]/10;
ans[i] %= 10;
}
bool boo = false;
for(i = MAXN-1; i >= 0; -- i)
{
if(ans[i] != 0 && !boo)
{
cout<<ans[i];
boo = true;
}
else if(boo)
cout<<ans[i];
}
cout<<endl;
}