Light OJ 1214 Large Division 【模拟除法】

1214 - Large Division

PDF (English)

Statistics

Forum

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 (-10²⁰⁰ ≤ a ≤ 10²⁰⁰) 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

恩，题目大意就是说，问前面的那个数能否整除后面那个数，恩，模拟除法就好了

<span style="font-family:Courier New;">#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long LL;
int main()
{
    int t,b,cnt=0;
    LL n;
    char s[220];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s%d",s,&b);
        int lens=strlen(s);
        int i=0;
        if(s[0]=='-')
            i++;
        n=0;
        for(;i<lens;++i)
        {
            n=n*10;
            n+=s[i]-'0';
            n=n%b;
        }
        printf("Case %d: ",++cnt);
        if(n==0)
            printf("divisible\n");
        else
            printf("not divisible\n");
    }
    return 0;
}</span>