大素数生成.docVIP

大素数生成 import java.util.*; import java.lang.*; class BigInt{ public final long JINGZHI=0 public final int ARRAY=10; public long s[]=new long[2*ARRAY]; /*存放大数*/ public int length; public BigInt(){ this.itarray(); } public BigInt(long a[]){ for(int i=0;i this.s[i]=a[i]; this.length=a.length; } public BigInt(BigInt a){ this.mov(a); } public void itarray()/*初始化类*/ { int i; for(i=0;i2*ARRAY;i++) { this.s[i]=0; } this.length=1; } public void mov(BigInt b)/*复制类*/ { int i; for(i=0;i { this.s[i]=b.s[i]; } this.length=b.length; } public void mov(long b){ this.itarray(); this.s[0]=b; } public int cmp(BigInt b)/*比较两个大数*/ { int i; if(this.lengthb.length) return 1; if(this.length for(i=this.length-1;i=0;i--) { if(this.s[i]b.s[i]) return 1; if(this.s[i] } return 0; } public int cmp(long b){ int i; if(this.length1) return 1; else if(this.s[0]b) return 1; else if(this.s[0] return 0; } public void add(BigInt b)/*加法运算*/ { int k=0,i,length; long temp,origin; if(this.length=b.length) length=this.length; else length=b.length; for(i=0;i { temp=this.s[i]+k; if(temp=JINGZHI) k=1; else k=0; origin=temp%JINGZHI; this.s[i]=origin; temp=this.s[i]+b.s[i]; if(temp=JINGZHI) k++; origin=temp%JINGZHI; this.s[i]=origin; } if(k!=0) {this.s[i]=k;this.length=length+1;} else {this.length=length;} } public void add(long a){ int k=0,i,length; long temp,origin; temp=this.s[0]+a; if(temp=JINGZHI) k=1; origin=temp%JINGZHI; this.s[0]=origin; for(i=1;i { temp=this.s[i]+k; if(temp=JINGZHI) k=1; else k=0; origin=temp%JINGZHI; this.s[i]=origin; } if(k!=0) {this.s[i]=k;this.length=this.length+1;} } public void sub(BigInt b) /*减法运算*/ { int z,k=0,i; BigInt e=new BigInt(); for(i=0;i { if(this.s[i]-k=b.s[i]) { e.s[i]=this.s[i]-b.s[i]-k; k=0; } else { e.s[i]=this.s[i]+JINGZHI-b.s[i]-k; k=1; } } while(i0e.s[i-1]==0) i--; if(i!=0) e.length=i; else e.length=1; this.mov(e); } public void sub(long a) { int k=0,i; BigInt e=new BigInt(); e.s[0]=this.s[0]-a; if(e.s[0]0) {e.s[0]+=JINGZHI;k=1;} for(i=1;i { if(this.s[i]-k