Time Limit: 1000MS | Memory Limit: 32768KB | 64bit IO Format: %lld & %llu |
Description
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
6
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
Source
第一次做大数题~以及终于明白同余定理怎么用了。
一个大的进步。
#include<stdio.h>
#include<string.h>
int main()
{
int t,l,i,k,j;
long int b,c;
int a[1000];
char zm[1000];
while(~scanf("%d",&t))
{
for(i=1;i<=t;i++)
{
getchar();
scanf("%s%ld",zm,&b);
memset(a,0,sizeof(a));
l=strlen(zm);
if(b<0)
b=-b;
if(zm[0]=='-')
{
for(k=1;k<l;k++)
a[k]=zm[k]-'0';
}
else
{
for(k=1;k<=l;k++)
a[k]=zm[k-1]-'0';
}
memset(zm,0,sizeof(zm));
c=a[1]%b;
for(j=2;j<k;j++)
c=(c*10+a[j])%b;
if(c==0)
printf("Case %d: divisible\n",i);
else
printf("Case %d: not divisible\n",i);
}
}
return 0;
}