I - Large Division

I - Large Division

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

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

题意：给你一个超大的a,和一个不太大的b,让你判断a是否能被b整除；

主要是一个公式吧。

res=(res*10+s[ i])%b;

听说是同余得到的；

其实仔细想一下就知道，这个就是把一个大整数拆分成很多部分，对每个部分求余。

代码：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;


typedef long long ll;
int main()
{
    int T;
    scanf("%d",&T);
    ll b;
    char s[1001];
    int kase=1;
    while(T--)
    {
        scanf("%s%lld",s,&b);
        if(b<0)
            b=-b;
        ll res=0;
        for(int i=0;i<strlen(s);i++)
        {
            if(s[i]=='-') continue;
            res=res*10+s[i]-'0';
            res=res%b;
        }
        res=res%b;
        printf("Case %d: ",kase++);
        if(res)
            printf("not divisible\n");
        else
            printf("divisible\n");
    }
    return 0;
}