LightOJ 1214 Large Division Solution

  ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long  int t,n,i,k=1;

    cin>>t;

    while(t--)

    {

        string s;

        long long int d,mod;

        cin>>s>>d;

        i=0,mod=0;

        d=abs(d);

        if(s[0]=='-')

            i=1;

        for( ;i<s.size(); i++)

        {

            mod=mod*10+s[i]-'0';

            mod=mod%d;

        }

        if(mod==0)

        printf("Case %d: divisible\n",k++);

        else

        printf("Case %d: not divisible\n",k++);

    }

    return 0;

}