Large Division
Time Limit: 1000MS |
|
Memory Limit: 32768KB |
|
64bit IO Format: %lld &%llu |
Submit Status
Description
Given integers, a and b, you should check whether a is divisible by b or not. We know A 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.
Starts with a line containing-integers a ( -10200≤a≤10200) and B (|b| > 0, b fits into a Signed integer). Numbers would not contain leading zeroes.
Output
For each case, print the case number first. Then print ' divisible ' if a was 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
Problem Setter:jane Alam Jan
Submit Status
B fits into a + bit signed integer ? To a long long.
#include <cstdio>#include<cstring>intMain () {intT, q=1; scanf ("%d", &t); while(t--) { Charnum[205];Long LongDiv; scanf ("%s%lld", NUM, &div); intLent=strlen (num); Long Longsum=0; for(intI=0; i<lent; i++) { if(num[i]=='-') Continue; Sum=sum*Ten+num[i]-'0'; Sum=sum%Div; } if(sum==0) printf ("Case %d:divisible\n", q++); Elseprintf ("Case %d:not divisible\n", q++); }}
LightOJ-1214 Large Division (co-Yu)