light oj 1214(同余定理）

1214 - Large Division

PDF (English)

Statistics

Forum

Time Limit: 1 second(s)

Memory Limit: 32 MB

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	Output for Sample Input
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

#include <iostream>

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 20000000;
char str[N];


int main()
{
    int t, ncase=1;
    scanf("%d", &t);
    while(t--)
    {
        long long  x;
        scanf("%s %lld",str, &x);
        int l, r, n=strlen(str);
        if(str[0]=='-')
            l=2,r=str[1]-'0';
        else
            l=1,r=str[0]-'0';
        long long sum=r%abs(x);
        for(int i=l;i<n;i++)
            sum=((sum*10)+(str[i]-'0'))%abs(x);
        if(sum==0)
            printf("Case %d: divisible\n",ncase++);
        else
            printf("Case %d: not divisible\n",ncase++);


    }
    return 0;
}