紅桜１ - プログラム倉庫

public class gin01{
public static void main(String[] args) {
double cs,xs,uc,ux;
double x[][]=new double[6][8];
double op[]=new double[8];
double h;
double maxv,minv;
int m,n;
int maxn,maxm;
int t1,t2,t3;
int p,mx;
double x1,x2;
double z;
int px,j;
cs=0.6;
xs=0.4;
h=0.02;
t3=0;
while(t3<10){
h=h/2;
t2=0;
while (t2<30){
uc=1/cs;
ux=1/xs;
for (m=0;m<6;m++){
for (n=0;n<8;n++){
x[m][n]=0;
}
}
x[0][1]=uc;
x[0][2]=ux;
x[1][1]=1;
x[1][3]=1;
x[1][0]=cs+h;
x[2][1]=-1;
x[2][4]=1;
x[2][0]=-cs+h;
x[3][2]=1;
x[3][5]=1;
x[3][0]=xs+h;
x[4][2]=-1;
x[4][6]=1;
x[4][0]=-xs+h;
x[5][1]=1;
x[5][2]=1;
x[5][7]=1;
x[5][0]=1;

maxv=0;
maxn=999;
for (n=1;n<8;n++){
if (x[0][n]>maxv)maxn=n;
if (x[0][n]>maxv)maxv=x[0][n];
}

t1=0;
while(t1<100){
maxm=999;
minv=999;
for (m=1;m<6;m++){
x1=x[m][maxn];
px=0;
if (x1==0)px=100;
if (px>50)x1=100;
x2=x[m][0]/x1;
if (x2<0)x2=9999;
if (px>50)x2=9999;
if (x2<minv)maxm=m;
if (x2<minv)minv=x2;
}

for (m=0;m<6;m++){
z=x[m][maxn]/x[maxm][maxn];
if (m==maxm)z=0;
for (n=0;n<8;n++){
x[m][n]=x[m][n]-z*x[maxm][n];
}
}

maxv=0;
maxn=999;
for (n=1;n<8;n++){
if (x[0][n]>maxv)maxn=n;
if (x[0][n]>maxv)maxv=x[0][n];
}
t1=t1+1;
if (maxn>100)t1=1000;
}


for (n=1;n<8;n++){
op[n]=-999;
}

for (n=1;n<8;n++){
p=0;
mx=0;
for (m=0;m<6;m++){
if (x[m][n]>0)mx=m;
if (x[m][n]<0)mx=m;
if (x[m][n]==0)p=p+1;
}
if (p==5)op[n]=x[mx][0]/x[mx][n];
}

if (op[1]>-100)cs=op[1];
j=0;
if (op[1]<-100)j=j+1;
if (op[3]>-100)j=j+1;
if (j==2)cs=cs+h-op[3];
j=0;
if (op[1]<-100)j=j+1;
if (op[3]<-100)j=j+1;
if (op[4]>-100)j=j+1;
if (j==3)cs=cs-h+op[4];
System.out.println(cs);

if (op[2]>-100)xs=op[2];
j=0;
if (op[2]<-100)j=j+1;
if (op[5]>-100)j=j+1;
if (j==2)xs=xs+h-op[4];
j=0;
if (op[2]<-100)j=j+1;
if (op[5]<-100)j=j+1;
if (op[6]>-100)j=j+1;
if (j==3)xs=xs-h+op[6];
System.out.println(xs);
t2=t2+1;
}
t3=t3+1;
}



}
}