LightOJ - 1214-Large Division(c++取模 + java的两种写法

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

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

代码：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<map>
#include<cmath>
const int maxn=1e5+5;
typedef long long ll;
using namespace std;
char str[205];
int main()
{
   int T;
   cin>>T;
   int b;
   int cnt=1;
   while(T--)
   {
       scanf("%s",str);
       scanf("%d",&b);
       if(b<0)
       b=-b;
       int len=strlen(str);
       ll ans=0;
       for(int t=0;t<len;t++)
       {
           if(str[t]>=‘0‘&&str[t]<=‘9‘)
           {
               ans=((ans*10)+(str[t]-‘0‘))%b;
        }
        else
        {
            continue;
        }
    }
    printf("Case %d: ",cnt++);
    if(ans==0)
    {
            puts("divisible");
    }
    else
    {
        puts("not divisible");
    }
   }
   return 0;
}

import java.math.BigInteger;
import java.util.Scanner;

public class Main
{
    public static void main(String[] args) {
        Scanner sc=new Scanner(system.in);
        int T;
        int cnt=1;
        T=sc.nextInt();
        while(T>=0)
        {
        BigInteger a,b,c;
        a=sc.nextBigInteger();
        b=sc.nextBigInteger();
        a=a.abs();
        b=b.abs();
        
        System.out.print("Case "+cnt+":");
        if(a.remainder(b).equals(BigInteger.ZERO))
        {
             System.out.println(" divisible");
        }
        else
        {
            System.out.println(" not divisible");
        }
        T--;
        cnt++;
        }
       
    }

}

import java.math.BigInteger;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // Todo Auto-generated method stub
        Scanner sc=new Scanner(system.in);
        int T;
        int cnt=1;
        T=sc.nextInt();
        while(T>=0)
        {
        BigInteger a,c;
  
        a=sc.nextBigInteger();
        b=sc.nextBigInteger();
        a=a.abs();
        b=b.abs();
        System.out.print("Case "+cnt+":");
     
        if(a.gcd(b).equals(b))
        {
             System.out.println(" divisible");
        }
        else
        {
            System.out.println(" not divisible");
        }
        T--;
        cnt++;
        }
       
    }

}