lightoj 1214 大数的整除

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

 

<span style="font-size:24px;">#include<stdio.h>
#include<span style="font-family: Arial, Helvetica, sans-serif;"><string.h></span></span>

<span style="font-size:24px;">int main()
{
	char a[220];
	int t,i,j,l;
	long long b,s;
	memset(a,0,sizeof(a));
	scanf("%d",&t);
	for(j=1;j<=t;j++)
	{   s=0;
		scanf("%s %lld",&a,&b);
		l=strlen(a);
		if(b<0)
		b=-b;
		if(a[0]=='-')
		{   for(i=1;i<l;i++)
			a[i-1]=a[i];
			l--;
		}
		for(i=0;i<l;i++)
		s=(a[i]-'0'+s*10)%b;
		printf("Case %d: ",j);
		if(s==0)
		printf("divisible\n");
		else
		printf("not divisible\n");
	}
	return 0;
 } </span>