Large Division LightOJ - 1214 （同余定理）

最新推荐文章于 2021-05-22 22:33:32 发布

Manton过

最新推荐文章于 2021-05-22 22:33:32 发布

阅读量244

点赞数

分类专栏：同余定理

本文链接：https://blog.csdn.net/Manton_dong/article/details/75941356

版权

同余定理专栏收录该内容

0 篇文章 0 订阅

订阅专栏

点击打开链接

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

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

题意：判断一个大数是否能被整除。

题解：利用同余定理判断余数是否为0，若为0，则能被整除。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#define N 1000
using namespace std;

char a[N];
int main(){
	int t,k=1;
	long long n;
	cin>>t;	
	while(t--){
	long long ans=0;
		cin>>a;
		cin>>n;
		int m=strlen(a);
		if(a[0]=='-'){			
			for(int i=1;i<m;i++){	
				ans=((ans*10+(a[i]-'0'))%n);		
			}
		}
		else{
			for(int i=0;i<m;i++){	
				ans=((ans*10+(a[i]-'0'))%n);		
			}
		}
		if(ans==0)
		cout<<"Case "<<k++<<": "<<"divisible"<<endl;
		else
		cout<<"Case "<<k++<<": "<<"not divisible"<<endl;
	}
	return 0;
}