中国剩余定理 非互质(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; 
	static long f [] = new long [100];
	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 % a[i] = r[i]
		BigInteger M=a[0],R=r[0];
		for(int i=1; i<len; i++) {
			BigInteger []result =  ex_gcd1(M,a[i]);
			dd = result[0];
			xx = result[1];
			yy = result[2];  
			if((R.subtract(r[i])).mod(dd).compareTo(BigInteger.ZERO)!=0) return BigInteger.valueOf(-1);
			BigInteger xxx = xx;
			xx=(R.subtract(r[i])).divide(dd);
			xx = xx.multiply(xxx).mod(a[i]);
			R= R.subtract(xx.multiply(M));
			M=M.divide(dd).multiply(a[i]);
			R= R.mod(M);
		}
		return (R.mod(M).add(M)).mod(M);
	}  
	static Scanner cin = new Scanner(System.in);
	public static void main(String[] args) {
		  f[0]=1;
		  f[1]=1;
		  for (int i = 2; i <= 80;i++) {
			  f[i]=f[i-1]+f[i-2];
		  }
		  int k;
		  k=cin.nextInt();
		  if(k<=0) {
			  System.out.println("Tankernb!");
			  return;
		  }
		  for (int i = 0; i < k;i++) {
			  a[i]=cin.nextBigInteger();
			  r[i]=cin.nextBigInteger();
		  }
		  BigInteger w=Chinaa(k);
		  //System.out.println(w);
		  if(w.compareTo(BigInteger.valueOf(1))<=0||w.compareTo(BigInteger.valueOf(1000000000000000l))>0) {
			  System.out.println("Tankernb!");
		  }
		  else {
			  boolean flag=false;
			  for (int i = 0; i <= 80;i++) {
				  if(w.compareTo(BigInteger.valueOf(f[i]))==0) {
					flag=true;  
					break;
				  }
			  }
			  if(flag) System.out.println("Lbnb!");
			  else System.out.println("Zgxnb!");
		  }
			
	}
}
发布了195 篇原创文章 · 获赞 27 · 访问量 2万+

猜你喜欢

转载自blog.csdn.net/lgz0921/article/details/100601527