lightoj1214——大数取余

题目链接：http://lightoj.com/volume_showproblem.php?problem=1214

Given two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a is divisible by an integer b if and only if there exists an integer c such that a = b * c.

Input

Input starts with an integer T (≤ 525), denoting the number of test cases.

Each case starts with a line containing two integers a (-10200 ≤ a ≤ 10200) and b (|b| > 0, b fits into a 32 bit signed integer). Numbers will not contain leading zeroes.

Output

For each case, print the case number first. Then print 'divisible' if a is divisible by b. Otherwise print 'not divisible'.

Sample Input

6

101 101

0 67

-101 101

7678123668327637674887634 101

11010000000000000000 256

-202202202202000202202202 -101

Sample Output

Case 1: divisible

Case 2: divisible

Case 3: divisible

Case 4: not divisible

Case 5: divisible

Case 6: divisible

 

题目理解：

判断b能否整除a

 

数据范围比较大，需要用字符串来存。

而且会有负数的情况要考虑。

从开头开始求，递推转换成数，对数进行取余就行了。挺好理解的。

最后判断最后的结果是不是0.

#include<iostream>
#include<cstring>
#define lli long long int
using namespace std;
int main(){
	int T;
	lli b,ans;
	char a[100005];
	scanf("%d",&T);
	for(int kcase=1;kcase<=T;kcase++){
		memset(a,0,sizeof(a));
		scanf("%s%lld",a,&b);
		if(b>0) b=-b;
		int len=strlen(a);
		ans=0;
		for(int i=0;i<len;++i){
			if(a[i]=='-') continue;
			ans=(a[i]-'0'+ans*10)%b;
		}
		if(ans==0)
			printf("Case %d: divisible\n",kcase);
		else
			printf("Case %d: not divisible\n",kcase);
	}
	return 0;
}