LightOJ - 1214 Large Division 大数取模

==

java取模应用

// package program;
// by lxk

import java.util.*;
import java.math.*;
import java.io.*;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		BigInteger t1 = BigInteger.valueOf(0);
		BigInteger t2 = BigInteger.valueOf(-1);
		int T = in.nextInt();
		for(int t_ = 1; t_ <= T; ++t_) {
			BigInteger a = in.nextBigInteger();
			BigInteger b = in.nextBigInteger();
			if(b.compareTo(t1) < 0) {
				b = b.multiply(t2);
				a = a.multiply(t2);
			}
			//System.out.println(a + "\n" + b);
			System.out.printf("Case %d: ", t_);
			if(a.mod(b) == BigInteger.valueOf(0)) 
				System.out.println("divisible");
			else 
				System.out.println("not divisible");
		}
	}
}