Divided Land（一道gcd的题）

第一次java做vj。

import java.math.*;import java.util.Scanner;public class Main{    public static BigInteger gcd(BigInteger a,BigInteger b){        if(b.equals(BigInteger.ZERO))            return a;        return gcd(b,a.mod(b));    }    public static void main(String[] args){        Scanner sc = new Scanner(System.in);        BigInteger a,b;        int t;        t=sc.nextInt();        for(int i=1;i<=t;i++){            a=sc.nextBigInteger(2);            b=sc.nextBigInteger(2);            a=gcd(a,b);            System.out.println("Case #"+i+": "+a.toString(2));          }    }}