Large Division LightOJ - 1214(模运算，数论水题)

最新推荐文章于 2020-09-23 16:10:55 发布

Guuuuuu老师儿

最新推荐文章于 2020-09-23 16:10:55 发布

阅读量274

点赞数

分类专栏： # 数论

本文链接：https://blog.csdn.net/codeswarrior/article/details/80051534

版权

数论专栏收录该内容

128 篇文章 0 订阅

订阅专栏

Large Division

LightOJ - 1214

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

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

比较水的一道题，直接a以字符串输入，转化成整数的时候每次模b，注意如果是负数都转成整数即可，因为能否整除和符号无关

code：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
    int t,cas = 0;
    scanf("%d",&t);
    while(t--){
        char a[250];
        long long b;
        scanf("%s%lld",a,&b);
        if(b < 0) b = -b;
        int i = 0;
        while(a[i] == '-') i++;
        long long ans = 0;
        for(; a[i]; i++){
            ans = (ans * 10 % b + a[i] - '0') % b;
        }
        if(!ans)
            printf("Case %d: divisible\n",++cas);
        else
            printf("Case %d: not divisible\n",++cas);
    }
    return 0;
}