F - Large Division（大数取模模板）

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

模板体，没有技术含量，在此记录一下，以便复习。

AC代码如下：

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<math.h>
#include<map>
#include<vector>
#include<set>
#include<iostream>
using namespace std;
typedef long long ll;
int main()
{
	int n,i;
	ll ans,b;
	char a[700];
	scanf("%d",&n);
	int k=1;
	while(n--)
	{
		scanf("%s%lld",a,&b);
		ans=0;
		if(b<0)	b=-1*b;
		for(i=0;i<strlen(a);i++)
		{
			if(a[0]=='-')	a[i]='0';
			ans=(ans*10+(a[i]-'0'))%b;
		}
		if(ans==0)
			printf("Case %d: divisible\n",k++);
		else
			printf("Case %d: not divisible\n",k++);
	}
	return 0;
}