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

 

模拟除法过程！

·

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
	char str[10001];
	long long a,b,c,i,n,cot=1;
	scanf("%lld",&n);
	while(n--)
	{
		scanf("%s%lld",str,&a);
		b=strlen(str);
		if(str[0]!='-')
		c=str[0]-'0';
		else
		c=str[1]-'0';
		for(i=0;i<b-1;i++)
		{
			if(str[i]>='0'&&str[i]<='9')
			{
				c=c%a;
				c=c*10+str[i+1]-'0';
			}
		}
		c=c%a;
		if(!c)
		printf("Case %lld: divisible\n",cot++);
		else
		printf("Case %lld: not divisible\n",cot++);
	}
	return 0;
}

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char str[910000];
int main()
{
	long long a,b,i,j,m,n,x,y,len,cot=1;
	scanf("%lld",&m);
	while(m--)
	{
		scanf("%s%lld",str,&b);
		b=abs(b);
		i=0;
		if(str[0]=='-')
		i++;
		a=str[i]-'0';
		if(!a)
		{
			printf("Case %lld: divisible\n",cot++);
			continue;
		}
		len=strlen(str);
		i++;
		while(a<b)
		{
		 	if(i==len)
			break;
			a=a*10+str[i++]-'0';
		}
		if(a<b)
		{
			printf("Case %lld: not divisible\n",cot++);
			continue;
		}
		long long t=a%b;
		while(i<len)
		{
			a=t*10+str[i++]-'0';
			t=a%b;
		}
		if(t)
		printf("Case %lld: not divisible\n",cot++);
		else
		printf("Case %lld: divisible\n",cot++);
	}
	return 0;
}