I-number

以下是真坑爹题目：

此题必须输出前导零，否则永远a不了

I-number

Time Limit: 5000MS Memory limit: 65536K

题目描述

The I-number of x is defined to be an integer y, which satisfied the the conditions below:
1. y>x;
2. the sum of each digit of y(under base 10) is the multiple of 10;
3. among all integers that satisfy the two conditions above, y shouble be the minimum.
Given x, you\'re required to calculate the I-number of x.

输入

 An integer T(T≤100) will exist in the first line of input, indicating the number of test cases.
The following T lines describe all the queries, each with a positive integer x. The length of x will not exceed 10⁵.

输出

 Output the I-number of x for each query.

示例输入

1
202

示例输出

208

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int f[100010];
int main()
{
    int n;
    scanf("%d",&n);
    {
        int i,j;
        int ts=1;
        for(ts=1; ts<=n; ts++)
        {
            memset(f,0,sizeof(f));
            char g[100010];
            scanf("%s",g);
            int t=strlen(g);
            for(i=0,j=t-1; g[i]!='\0'; i++,j--)
                f[j]=g[i]-'0';
            int sum;
            while(1)
            {
                sum=0;
                f[0]=f[0]+1;
                for(i=0; i<=t-1;i++)
                {
                    if(f[i]>=10)
                    {
                        f[i]=f[i]%10;
                        f[i+1]=f[i+1]+1;
                    }
                    else break;
                }
                if(f[t]>0)t++;
                for(i=0;i<=t-1;i++)
                    sum=sum+f[i];
                if(sum%10==0)
                {
                    for(i=t-1;i>=0;i--)
                    printf("%d",f[i]);
                    printf("\n");
                    break;
                }
            }
        }
    }
    return 0;
}