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 105.
输出
Output the I-number of x for each query.
示例输入
示例输出
提示
来源
2013 Multi-University Training Contest 1
我不得不说这道题真的很坑，我要是不搜题解估计是毁掉了 本来题意很简单，就是给定一个x（由于可能很大用字符串模拟），求出比x大的且各位数字之和为10的倍数的数，
要求输出符合上诉条件的最小数。but,这个x竟然是可以有前导0的（它没说）也就是说输入 00202 输出 00208
代码略挫QAQ
HDU 4608 I-number--简单模拟,布布扣,bubuko.com
HDU 4608 I-number--简单模拟
原文：http://blog.csdn.net/qq_16255321/article/details/37993465
