#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
char s[205];
long long int num;
int t;
int main()
{
scanf("%d",&t);
for(int i=1;i<=t;i++)
{
getchar();
scanf("%s%lld",s,&num);
if(num<0) num*=-1;
long long int val=0;
for(int j=0;j<strlen(s);j++)
{
if(s[j]=='-') continue ;
val=(val*10+s[j]-'0')%num;
}
printf("Case %d: ",i);
if(!val) printf("divisible\n");
else printf("not divisible\n");
}
return 0;
}
Light OJ-1214-大数取余
最新推荐文章于 2020-09-23 16:10:55 发布