The Preliminary Contest for ICPC Asia Xuzhou 2019 A.Who is better? （中国剩余定理+斐波那契博弈）

题目链接：https://nanti.jisuanke.com/t/41383

题解：给你n个同余式，让你求出n之后，然后再斐波那契博弈输出即可

由于不知道哪里出错，C++  WA了，用了Java大数

import java.math.BigInteger;
import java.util.Scanner;
 
public class Main { 
	static BigInteger dd;
	static BigInteger  xx;
	static BigInteger yy;
	static BigInteger []a = new BigInteger [1005];
	static BigInteger []r = new BigInteger [1005];
	static BigInteger o = BigInteger.ONE;
	static BigInteger z = BigInteger.ZERO;  
	public static BigInteger[] ex_gcd1(BigInteger a,BigInteger b)	{ 
		BigInteger ans; BigInteger[] result=new BigInteger[3]; 
		if(b.compareTo(BigInteger.ZERO) == 0) { 
			result[0]=a;
			result[1]=o; 
			result[2]=z; 
			return result;
		} 
		BigInteger [] temp=ex_gcd1(b,a.mod(b)); 
		ans = temp[0]; 
		result[0]=ans; 
		result[1]=temp[2];
		result[2]=temp[1].subtract((a.divide(b)).multiply(temp[2]));
		return result; 
	} 
	static BigInteger Chinaa(int len) { //n % r[i] = a[i]
		BigInteger M=a[0],R=r[0];
		for(int i=1; i