http://acm.hdu.edu.cn/showproblem.php?pid=4608
直接暴力
代码：
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<vector>
#include<algorithm>
#include<queue>
#include<stdexcept>
#include<bitset>
#include<cassert>
#include<deque>
#include<numeric>using namespace std;typedef long long ll;
typedef unsigned int uint;
const double eps=1e-12;
const int INF=0x3f3f3f3f;
const ll MOD=1000000007;
const int N=1000005;
char s[N];
int a[N];
int ln;
int add()
{++a[0];int l=0;for(l=0;a[l]>9;++l){a[l]=0;a[l+1]++;}if(a[ln]>0) ++ln;int M=0;for(int i=0;i<ln;++i)M=(M+a[i])%10;return M;
}
int main()
{//freopen("data.in","r",stdin);int T;scanf("%d",&T);gets(s);while(T--){gets(s);ln=strlen(s);reverse(s,s+ln);memset(a,0,sizeof(a));for(int i=0;i<ln;++i)a[i]=s[i]-'0';while(add()!=0) ;for(int i=ln-1;i>=0;--i)printf("%d",a[i]);printf("\n");}return 0;
}
