杭电4608(I-number) java写很简略 就是超内存!
杭电4608(I-number) java写很容易 就是超内存!!!
不用java就用大数模板做见hdu1002,java写很容易 就是超内存!!!
Problem 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.
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 105.
The following T lines describe all the queries, each with a positive integer x. The length of x will not exceed 105.
Output
Output the I-number of x for each query.
Sample Input
1 202
Sample Output
208
实现代码
import java.util.*; import java.math.*; class Main{ public static void main(String[] args){ final BigInteger P=BigInteger.ONE; Scanner sc=new Scanner(System.in); int t=sc.nextInt(); while(t-->0){ int sum; BigInteger x=sc.nextBigInteger(); while(true){ x=x.add(P); String str=x.toString(); sum=0; for(int i=0;i<str.length();i++){ sum+=str.charAt(i)-'0'; } if(sum%10==0){ System.out.println(x); break; } } } } }