G - Large Division
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.
OutputFor each case, print the case number first. Then print 'divisible' if a is divisible by b. Otherwise print 'not divisible'.
Sample Input6
101 101
0 67
-101 101
7678123668327637674887634 101
11010000000000000000 256
-202202202202000202202202 -101
Sample OutputCase 1: divisible
Case 2: divisible
Case 3: divisible
Case 4: not divisible
Case 5: divisible
Case 6: divisible
题意:大数整除问题,判断前一个数是否能整除后面的一个数。
题解:开始我用long long 类型但是还是WA,后来上网查了下,要用同余定理。
#include <stdio.h>
#include <string.h>
int main()
{
int T;
int b;
int count = 0;
char s[2050000];
__int64 sum;
sum = 0;
scanf("%d",&T);
while(T--)
{
sum = 0;
int i;
count++;
scanf("%s",s);
scanf("%d",&b);
for(i = 0;s[i] != '\0';i++)
{
if(s[i] == '-')
{
continue;
}
sum = (sum * 10 + s[i] - '0') % b;
}
if(sum == 0)
{
printf("Case %d: divisible\n",count);
}
else
{
printf("Case %d: not divisible\n",count);
}
}
return 0;
}