light oj 1214 - Large Division (同于定理--整除运算)

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

 解：判断大数是否能被整除，用字符串输入，用同余定理判断最后余数是否为0即可

代码：

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

int main()
{
    int t,k=1;
    char str[210];
    long long b;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s %lld",str,&b);
        long long ans=0;
        int len=strlen(str);
        for(int i=0;i<len;i++)
        {
            if(str[i]=='-')
                continue;
            ans=(ans*10+(str[i]-'0'))%b;
        }
        if(ans)
            printf("Case %d: not divisible\n",k++);
        else
            printf("Case %d: divisible\n",k++);
    }
    return 0;
}