2396 Large Division
时间限制 : 2000/1000 MS(Java/Others) | 内存限制 : 65536/32768 KB(Java/Others)
提交数 : 65 | 通过数 : 34
题目描述
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 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.
输出要求
For each case, print the case number first. Then print 'divisible' if a is divisible by b. Otherwise print 'not divisible'.
输入样例
6
101 101
0 67
-101 101
7678123668327637674887634 101
11010000000000000000 256
-202202202202000202202202 -101
输出样例
Case 1: divisible
Case 2: divisible
Case 3: divisible
Case 4: not divisible
Case 5: divisible
Case 6: divisible
提示
来源
Light OJ
[ 返回顶端 ] | [ 代码提交 ] | [ 统计数据 ] | [ 历史提交 ]