题目:K - Large Division LightOJ - 1214
/**********
用字符串 模拟大数取余
*************/
#include<bits/stdc++.h>
using namespace std;
const int maxn = 204;
char a[maxn];
long b;
long Mod(int i)
{
long ret = 0;
int len = strlen(a);
for(;i < len;i++)
{
ret = (ret*10+a[i]-'0')%b;
}
return ret;
}
int main()
{
int T, cnt = 0;
scanf("%d", &T);
while(T--)
{
scanf("%s", a);
scanf("%ld", &b);
long ans = 0;
if(a[0] == '-') ans = Mod(1);//不用看正负号
else ans = Mod(0);
printf("Case %d: ", ++cnt);
if(!ans)
{
printf("divisible\n");
}
else
{
printf("not divisible\n");
}
}
return 0;
}