I - Fibonacci in the Pocket ZOJ - 4108 【 找规律 + Java 大数 】

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 = sc.nextInt();
		while(T-->0){
			BigInteger a,b;
			a = sc.nextBigInteger();
			b = sc.nextBigInteger();
			BigInteger x = a.mod(new BigInteger("3"));
			BigInteger y = b.mod(new BigInteger("3"));
			if(x.compareTo(new BigInteger("1")) == 0 && y.compareTo(new BigInteger("1")) == 0) System.out.println(1);
			else if(x.compareTo(new BigInteger("0")) == 0 && y.compareTo(new BigInteger("1")) == 0) System.out.println(1);
			else if(x.compareTo(new BigInteger("2")) == 0 && y.compareTo(new BigInteger("0")) == 0) System.out.println(1);
			else if(x.compareTo(new BigInteger("2")) == 0 && y.compareTo(new BigInteger("2")) == 0) System.out.println(1);
			else System.out.println(0);
		}

	}

}