I - I-number HDU - 4608

最新推荐文章于 2020-12-09 11:16:27 发布

圣诞老人家

最新推荐文章于 2020-12-09 11:16:27 发布

阅读量198

点赞数

分类专栏：多校数论

本文链接：https://blog.csdn.net/tianyuhang123/article/details/71081896

版权

多校同时被 2 个专栏收录

63 篇文章 0 订阅

订阅专栏

数论

30 篇文章 0 订阅

订阅专栏

本文介绍了一种名为I-Number的特殊整数计算方法。I-Number定义为满足特定条件的最小整数y：y大于给定整数x且其各位数字之和为10的倍数。文章提供了一个C++实现示例，通过大数加法解决该问题。

摘要由CSDN通过智能技术生成

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

1
202

Sample Output

Hint

大数加法：

ac代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char a[1000010],b[1000010];
int main()
{
    int n;
    cin>>n;
    getchar();
    while(n--)
    {
        gets(a);
        int len=strlen(a);
        int sum=0;
        for(int i=0; i<len; i++)
        {
            sum+=(a[i]-'0');
            b[len-1-i]=a[i];
        }
        int k=len-1;
        for(int i=0;;i++)
        {
            int g=1;
            for(int j=0;;j++)
            {
                if(j>k)
                {
                    b[j]='0';
                    k=j;
                }
                sum=sum+(b[j]+g-'0')%10-(b[j]-'0');
                int h=(b[j]+g-'0');
                g=h/10;
                b[j]=h%10+'0';
                if(g==0)
                break;
            }
            if(sum%10==0)
            break;
        }
        for(int i=max(k,len-1); i>=0; i--)
            printf("%c",b[i]);
        cout<<endl;
    }
    return 0;
}