kuangbin专题十四 LightOJ 1214 大数除法

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define LL long long int
const int MAXN=200+7;
char s[MAXN];
int main()
{
int t,k=1;
scanf("%d",&t);
while(t--)
{
LL b;
scanf("%s %lld",&s,&b);
if(s[0]=='0')
{
printf("Case %d: divisible\n",k++);
continue;
}
LL sum=0;
for(int i=0;i<strlen(s);i++)
{
if(s[i]=='-')
continue;
sum=sum*10+s[i]-'0';
sum%=b;
}
if(sum==0)
printf("Case %d: divisible\n",k++);
else
printf("Case %d: not divisible\n",k++);
}
}