LightOJ 1214 - Large Division (同余定理)

1214 - Large Division

PDF (English)

Statistics

Forum

Time Limit: 1 second(s)

Memory Limit: 32 MB

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 (-10²⁰⁰ ≤ a ≤ 10²⁰⁰) 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	Output for Sample Input
6 101 101 0 67 -101 101 7678123668327637674887634 101 11010000000000000000 256 -202202202202000202202202 -101	Case 1: divisible Case 2: divisible Case 3: divisible Case 4: not divisible Case 5: divisible Case 6: divisible

 

题意：给出a，问a是否能整除b。注意a是高精度大数。

同余定理，很简单。

代码如下：

#include<cstdio>
#include<cstring>
char str[210];
int main()
{
	int t,k=1,i,cnt;
	long long ans,b;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%s%lld",str,&b);
		int len=strlen(str);
		if(b<0)//b为负数要变为正 
			b=-b;
		if(str[0]=='-')//a为负数也要变为正 
		{
			ans=str[1]-'0';
			cnt=2;
		}
		else
		{
			ans=str[0]-'0';
			cnt=1;
		}	
		ans=ans%b;
		for(i=cnt;i<len;++i)
			ans=(ans*10+(str[i]-'0'))%b;
		if(!ans)
			printf("Case %d: divisible\n",k++);
		else
			printf("Case %d: not divisible\n",k++);
	} 
	return 0;
}