package 数学问题;
public class case09_同余方程组 {
static long x;
static long y;
public static long ext_gcd(long a,long b){
if(b==0){
x=1;
y=0;
return a;
}
long res=ext_gcd(b,a%b);
//xy已经被下一层递归更新了
long x1=x;//备份
x=y;
y=x1-a/b*y;
return res;
}
//线性方程
public static long linearEquation(long a,long b,long m) throws Exception{
long d=ext_gcd(a,b);
if(m%d!=0) throw new Exception("无解");
long n=m/d;
x*=n;
y*=n;
return d;
}
/**
* x=a1(%m1)
* =a2(%m2)
* =a3(%m3)
* =a1+m1y1
* x=a1+m1y1(1)
* x=a2+m2y2
* ==>m1y1-m2y2=a2-a1
*由线性方程linearEquation(m1,-m2,a2-a1)求解y1
* 带回(1),得特解x0 = al+m1*yl --> x =x0 + k*lcm (m1 , m2)得一个新方程x=xo(mod lcm (m1 ,m2) )
* @param a
* @param m
* @return
*/
//同余方程组
public static long linearEquationGroup(long[] a,long[] m){
int len=a.length;
if(len==0&&a[0]==0) return m[0];
for(int i=1;i<len;i++){
long a2_a1=a[i]-a[i-1];
try {
long d = linearEquation(m[i - 1], -m[i], a2_a1);
long x0=a[i-1]+m[i-1]*x;
long lcm=m[i]*m[i-1]/d;
a[i]=(x0%lcm+lcm)%lcm;
m[i]=lcm;
}catch (Exception e){
System.out.println("无解");
}
}
return a[len-1]%m[len-1];
}
public static void main(String[] args) throws Exception {
case09_同余方程组 O=new case09_同余方程组();
long[] a={2,3,2};
long[] m= {3,5,7};
try {
long res=O.linearEquationGroup(a,m);
System.out.println(res);
}catch (Exception e){
System.out.println("无解");
}
}
}
题9:同余方程组
最新推荐文章于 2024-10-16 10:13:45 发布