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 (-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 | 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,b,问a能否被b整除,a是一个高精度的大数,运用同余定理
代码:
#include<stdio.h>
#include<string.h>
char a[3000000];
int b;
int main()
{
int T;
int i,l;
long long sum;
int k=1;
scanf("%d",&T);
while(T--)
{
sum=0;
scanf("%s%d",a,&b);
l=strlen(a);
for(i=0;i<l;i++)
{
if(a[i]=='-')
continue;
sum=(sum*10+a[i]-'0')%b;
}
if(sum==0)
printf("Case %d: divisible\n",k++);
else
printf("Case %d: not divisible\n",k++);
}
return 0;
}