HDU-4608 I-number 枚举

　　题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4608

　　直接暴力枚举，没什么好说的。。。。

//STATUS:C++_AC_765MS_740KB
#include <functional>
#include <algorithm>
#include <iostream>
//#include <ext/rope>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;
//using namespace __gnu_cxx;
//define
#define pii pair<int,int>
#define mem(a,b) memset(a,b,sizeof(a))
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI acos(-1.0)
//typedef
typedef __int64 LL;
typedef unsigned __int64 ULL;
//const
const int N=100010;
const int INF=0x3f3f3f3f;
const int MOD=100000,STA=8000010;
const LL LNF=1LL<<60;
const double EPS=1e-8;
const double OO=1e15;
const int dx[4]={-1,0,1,0};
const int dy[4]={0,1,0,-1};
const int day[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
//Daily Use ...
inline int sign(double x){return (x>EPS)-(x<-EPS);}
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T lcm(T a,T b,T d){return a/d*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
template<class T> inline T Min(T a,T b,T c){return min(min(a, b),c);}
template<class T> inline T Max(T a,T b,T c){return max(max(a, b),c);}
template<class T> inline T Min(T a,T b,T c,T d){return min(min(a, b),min(c,d));}
template<class T> inline T Max(T a,T b,T c,T d){return max(max(a, b),max(c,d));}
//End

char s[N];
int num[N];
int T,len;

void add(int *num)
{
    int i,t;
    num[0]+=1;
    if(num[0]<10)return;
    else t=1,num[0]=0;
    for(i=1;i<len;i++){
        num[i]+=t;
        t=num[i]/10;
        if(num[i]>=10)num[i]-=10;
        else return;
    }
    if(t){
        num[i]=1;
        len++;
    }
    return;
}

bool isok(int *num)
{
    int i,sum=0;
    for(i=0;i<len;i++)
        sum+=num[i];
    return sum%10;
}

int main()
{
 //   freopen("in.txt","r",stdin);
    int i,j;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s",s);
        len=strlen(s);
        for(i=0;i<len;i++){
            num[len-i-1]=s[i]-'0';
        }
        add(num);
        while(isok(num)){
            add(num);
        }

        for(i=len-1;i>=0;i--)
            printf("%d",num[i]);
        putchar('
');
    }
    return 0;
}