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 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
using namespace std;
char str[210];
int main()
{
int t,i,j,k=1;
long long b;
scanf("%d",&t);
while(t--){
scanf("%s%lld",str,&b);
int l=strlen(str);b=abs(b);
long long m=0;
for(i=0;i<l;++i){
if(str[i]=='-')continue;
m=(m*10+str[i]-'0')%b;
}
printf("Case %d: ",k++);
if(m==0){
printf("divisible\n");
}
else {
printf("not divisible\n");
}
}
return 0;
}