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²⁰⁰ ≤ a ≤ 10²⁰⁰) 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，真的顶呱呱：快问问神奇海螺java大数怎么用

代码:

import java.util.Scanner;
import java.math.BigInteger;
public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int t;
		BigInteger a,b,c = new BigInteger("0");
		t = scan.nextInt();
		for(int i=1;i<=t;i++) {
			a = scan.nextBigInteger();
			b = scan.nextBigInteger();
			if(a.remainder(b).equals(c)){
				System.out.println("Case "+i+": divisible");
			}
			else {
				System.out.println("Case "+i+": not divisible");
			}
		}
	}
}