Lightoj 1214 (divide large numbers)

Large Division

Description

Given integers, a and b, you should check whether a is divisible by b or not.  We know A 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.

Starts with a line containing-integers a ( -10200≤a≤10200) and B (|b| > 0, b fits into a Signed integer). Numbers would not contain leading zeroes.

Output

For each case, print the case number first. Then print ' divisible ' if a was 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

Directly on Java

Import java.io.*;import java.util.*;import java.math.*;p ublic class Main {public static void main (string[] args) {//TODO Auto-generated method Stubscanner in = new Scanner (system.in); BigInteger A, B;int t;t = In.nextint (); for (int i = 1; I <= t; i++) {a = In.nextbiginteger (); b = In.nextbiginteger (); if (B.compareto (Biginteger.zero) <0) b=b.multiply (biginteger.valueof (-1)); BigInteger C = a.mod (b), if (c = = Biginteger.zero) System.out.println ("case" + i + ":" + "divisible"); elseSystem.out.print ln ("case" + i + ":" + "not divisible");}}}

Lightoj 1214 (divide large numbers)