（大数 求余） Large Division Light OJ 1214

Large Division

Given two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a is divisible by an integer b if and only if there exists an integer c such that a = b * c.

Input

Input starts with an integer T (≤ 525), denoting the number of test cases.

Each case starts with a line containing two integers a (-10^200 ≤ a ≤ 10^200) and b (|b| > 0, b fits into a 32 bit signed integer). Numbers will not contain leading zeroes.

Output

For each case, print the case number first. Then print 'divisible' if a is divisible by b. Otherwise print 'not divisible'.

Sample Input

6

101 101

0 67

-101 101

7678123668327637674887634 101

11010000000000000000 256

-202202202202000202202202 -101

Sample Output

Case 1: divisible

Case 2: divisible

Case 3: divisible

Case 4: not divisible

Case 5: divisible

Case 6: divisible

 

可以用JAVA：

 

import java.math.BigInteger;
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t=in.nextInt();
        int sum;
        sum=0;
        BigInteger a,b;
        BigInteger c=BigInteger.valueOf(0);
        while(t-->0) {
            sum++;
            a=in.nextBigInteger();
            b=in.nextBigInteger();
            if(a.remainder(b).equals(c))    //equal括号内的数据类型必须是大整数类的，不能是int类型的。
                System.out.println("Case "+sum+": divisible");
            else
                System.out.println("Case "+sum+": not divisible");
        }
    }  
}

 

转载于:https://www.cnblogs.com/Weixu-Liu/p/9165559.html