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

大数取余题，b用long long

#include<stdio.h>
#include<string.h>
int main()
{
    int T;
    scanf("%d",&T);
    int g=0;
    while(T--)
    {
        char a[300];
        ++g;
        long long int b;
        scanf("%s %lld",a,&b);
        int l=strlen(a);
        long long int sum=0;
        if(b<0)
            b=-b;
        printf("Case %d: ",g);
        if(l==1&&a[0]=='0')
        {
            printf("divisible\n");
            continue;
        }
        for(int i=0; i<l; i++)
        {
            if(a[i]=='-')
                continue;
            sum=sum*10+a[i]-'0';
            sum=sum%b;
        }
        if(sum==0)
            printf("divisible\n");
        else
            printf("not divisible\n");
    }
    return 0;
}