题目链接:http://www.lightoj.com/volume_showproblem.php?problem=1214
题目解析:前面是大数,后面是整形数,用int定义,大数自然用到字符串;要是能整处的话,输出:“divisible”,否则“not divisible”
#include<string>
#include<algorithm>
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
int n,t,b,i;
char a[205];
cin>>n;
memset(a,0,sizeof(a));
for(t=1;t<=n;t++){
cin>>a>>b;
b=b<0?-b:b;
i=a[0]=='-'?1:0;
__int64 d=0;
for(;i<strlen(a);i++){
d=d*10+a[i]-'0';
d=d%b;
}
printf("Case %d: ",t);
if(d)
cout<<"not divisible"<<endl;
else
cout<<"divisible"<<endl;
}
return 0;
}