Large Division

最新推荐文章于 2021-02-09 19:31:52 发布

荣不翻身的咸鱼

最新推荐文章于 2021-02-09 19:31:52 发布

阅读量170

点赞数

CC 4.0 BY-SA版权

分类专栏：基础题

本文链接：https://blog.youkuaiyun.com/wu1997___/article/details/82318854

基础题专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种使用Java实现的方法，用于判断一个大整数是否能被另一个整数整除。利用BigInteger类处理可能超出基本数据类型范围的大整数运算，并提供样例输入输出展示程序功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 (-10200 ≤ a ≤ 10200) 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

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

import java.math.BigInteger;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int t = s.nextInt();
        int cas=1;
        while(t-->0)
        {
            BigInteger a = s.nextBigInteger();
            BigInteger b = s.nextBigInteger();
            b=b.abs();
            if(a.mod(b)==BigInteger.ZERO)
            {
                System.out.println("Case "+cas+": "+"divisible");
                cas++;
            }
            else
            {
                System.out.println("Case "+cas+": "+"not divisible");
                cas++;
            }
        }
    }
}