light oj 1214 Large Division

                                                                          Large Division

Description

Given two integers, a and b, you should check whethera is divisible by b or not. We know that an integera is divisible by an integer b if and only if there exists an integerc 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²⁰⁰) andb (|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' ifa 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

题意：给两个数m，n，求m是否能整除n，n的范围会爆int

用同余定理即可：http://blog.csdn.net/u013269810/article/details/42874409，需要注意的只有n会爆int，其余就没什么坑了

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<queue>
#include<deque>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<utility>

using namespace std;

typedef long long ll;

#define for1(i,a) for(int (i)=1;(i)<=(a);(i)++)
#define for0(i,a) for(int (i)=0;(i)<(a);(i)++)
#define pf printf
#define sf scanf
#define mem(i,a) memset(i,a,sizeof i)
#define eps 1e-10
#define pi acos(-1.0)
#define _s second
#define _f first

ll m;
int T;
char g[250];

int main()
{
    sf("%d",&T);
    for1(i,T)
    {
        sf("%s%lld",g,&m);
        ll num=0;
        pf("Case %d: ",i);
        for0(j,strlen(g))
        {
            if(g[j]=='-')continue;
            num=(num*10+g[j]-'0')%m;//同余定理的运用
        }
        pf(num?"not divisible\n":"divisible\n");
    }
    return 0;
}