I-number

最新推荐文章于 2020-07-01 14:05:29 发布

nianiajr

最新推荐文章于 2020-07-01 14:05:29 发布

阅读量637

点赞数

分类专栏：多校文章标签：枚举

本文链接：https://blog.csdn.net/liangjiaruifighting/article/details/9826123

版权

多校专栏收录该内容

4 篇文章 0 订阅

订阅专栏

B - I-number

Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status

Appoint description:

Description

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.

Input

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

Output the I-number of x for each query.

Sample Input

Sample Output

注意前导零，坑得一B。。。

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int sum;
int s[1000005];
int main(){
	int t,x,len;
    char s[1000005];
	scanf("%d",&t);
	while(t--){
        s[0]='0',s[1]='0';
        scanf("%s",s+2);
        len=strlen(s);
        sum=0;
        for(int i=0;i<len;i++){
           s[i]-='0';
           sum+=s[i];
        }
	    do{
    	   int i=len-1;
    	   while(s[i]==9){
   		     sum-=9;
   		     s[i--]=0;
    	   }
    	   s[i]++;
    	   sum++;
    	}while(sum%10!=0);
    	
    	for(int i=1;i<len;i++){
            if(i==1&&s[i]==0)continue;
            printf("%d",s[i]);
        }
        printf("\n");
	}
	return 0;
}