１４ １４ ｌ；ｌ； - プログラム倉庫

public class tax13{
public static void main(String[] args) {
double th1[]=new double[11];
double th2[]=new double[11];
double y1[][]=new double[11][11];
double y2[][]=new double[11][11];
double c[][]=new double[11][11];
double up[][]=new double[11][11];
int mrank[]=new int[101];
int frank[]=new int[101];
double tk,tl,tr;
double c1,w1,w2,l1,l2;  
double we,minu;
double maxwel,maxtk,maxtl,maxtr;
int n,n1,n2,s1,s2;
for (s1=1;s1<11;s1++){
th1[s1]=0.2*s1;
}
for (s2=1;s2<11;s2++){
th2[s2]=0.1*s2;
}
maxwel=-999;
maxtk=0;
maxtl=0;
maxtr=0;
for (n1=5;n1<40;n1++){
for (n2=5;n2<40;n2++){
tk=0.01*n1;
tl=0.01*n2;
tr=trs(tk,tl,th1,th2);
we=wel(tk,tl,tr,th1,th2);;
if (we>maxwel)maxtk=tk;  
if (we>maxwel)maxtl=tl;  
if (we>maxwel)maxtr=tr;  
if (we>maxwel)maxwel=we;  
}
}
tk=maxtk;
tl=maxtl;
tr=maxtr;
for (s1=1;s1<11;s1++){
for (s2=1;s2<11;s2++){
l1=mlx(s1,s2,tk,tl,tr,th1,th2);
l2=flx(s1,s2,tk,tl,tr,th1,th2);
w1=(1-tk)*th1[s1];
w2=(1-tl)*th2[s2];
y1[s1][s2]=th1[s1]*l1;
y2[s1][s2]=th2[s2]*l2;
c[s1][s2]=w1*l1+w2*l2+tr;
up[s1][s2]=ux(c[s1][s2],l1,l2);
}
}
for (n=1;n<101;n++){
minu=999;
mrank[n]=1;
frank[n]=1;
for (s1=1;s1<11;s1++){
for (s2=1;s2<11;s2++){
if (up[s1][s2]<minu)mrank[n]=s1;
if (up[s1][s2]<minu)frank[n]=s2;
if (up[s1][s2]<minu)minu=up[s1][s2];
}
}
s1=mrank[n];
s2=frank[n];
up[s1][s2]=9999;
System.out.println(s1);  
System.out.println(s2);  
}
}
static double bud(double tk,double tl,double tr,double th1[],double th2[]){
double b1,w1,w2,l1,l2,c1;
int s1,s2,i;
b1=0;
for (s1=1;s1<11;s1++){
for (s2=1;s2<11;s2++){
w1=(1-tk)*th1[s1];
w2=(1-tl)*th2[s2];
l1=1-(w1+w2+tr)/(3*w1);
l2=1-(w1+w2+tr)/(3*w2);
i=0;
if (l1<0)i=i+1;  
if (l2>0)i=i+1;  
if (i==2)l1=0;  
if (i==2)l2=(w2-tr)/(2*w2);  
i=0;
if (l1>0)i=i+1;  
if (l2<0)i=i+1;  
if (i==2)l1=(w1-tr)/(2*w1);  
if (i==2)l2=0;  
c1=w1*l1+w2*l2+tr;
b1=b1+th1[s1]*l1+th2[s2]*l2-c1;
}
}
return b1;
}
static double wel(double tk,double tl,double tr,double th1[],double th2[]){
double we,w1,w2,l1,l2,c1;
int s1,s2,i;
we=0;
for (s1=1;s1<11;s1++){
for (s2=1;s2<11;s2++){
w1=(1-tk)*th1[s1];
w2=(1-tl)*th2[s2];
l1=1-(w1+w2+tr)/(3*w1);
l2=1-(w1+w2+tr)/(3*w2);
i=0;
if (l1<0)i=i+1;  
if (l2>0)i=i+1;  
if (i==2)l1=0;  
if (i==2)l2=(w2-tr)/(2*w2);  
i=0;
if (l1>0)i=i+1;  
if (l2<0)i=i+1;  
if (i==2)l1=(w1-tr)/(2*w1);  
if (i==2)l2=0;  
c1=w1*l1+w2*l2+tr;
we=we+Math.log(c1)+Math.log(1-l1)+Math.log(1-l2);
}
}
return we;
}
static double trs(double tk,double tl,double[] th1,double[] th2){
double tr1,tr2,tr3,b1,b2;
int t1;
tr1=0.1;
tr2=0.05;
b1=bud(tk,tl,tr1,th1,th2);  
t1=0;
while(t1<100){
b2=bud(tk,tl,tr2,th1,th2);
tr3=tr2-b2*(tr2-tr1)/(b2-b1);
b1=b2;
tr1=tr2;
tr2=tr3;
if (b2*b2<0.001)t1=1000;  
t1=t1+1;
}
return tr2;
}
static double ux(double c1,double l1,double l2){
int pp;
double u1,cp1,lp1,lp2;
pp=0;
cp1=c1;
lp1=l1;
lp2=l2;
if (lp1<0)pp=100;  
if (lp1>0.99)pp=100;  
if (lp2<0)pp=100;  
if (lp2>0.99)pp=100;  
if (pp>50)lp1=0.5;  
if (pp>50)lp2=0.5;  
u1=Math.log(cp1)+Math.log(1-lp1)+Math.log(1-lp2);
if (pp>50)u1=-999;
return u1;
}
static double mlx(int s1,int s2,double tk,double tl,double tr,double[] th1,double th2[]){
int i;
double w1,w2,l1,l2;
w1=(1-tk)*th1[s1];
w2=(1-tl)*th2[s2];
l1=1-(w1+w2+tr)/(3*w1);
l2=1-(w1+w2+tr)/(3*w2);
i=0;
if (l1<0)i=i+1;  
if (l2>0)i=i+1;  
if (i==2)l1=0;  
if (i==2)l2=(w2-tr)/(2*w2);  
i=0;
if (l1>0)i=i+1;  
if (l2<0)i=i+1;  
if (i==2)l1=(w1-tr)/(2*w1);  
if (i==2)l2=0;  
return l1;
}
static double flx(int s1,int s2,double tk,double tl,double tr,double[] th1,double th2[]){
int i;
double w1,w2,l1,l2;
w1=(1-tk)*th1[s1];
w2=(1-tl)*th2[s2];
l1=1-(w1+w2+tr)/(3*w1);
l2=1-(w1+w2+tr)/(3*w2);
i=0;
if (l1<0)i=i+1;  
if (l2>0)i=i+1;  
if (i==2)l1=0;  
if (i==2)l2=(w2-tr)/(2*w2);  
i=0;
if (l1>0)i=i+1;  
if (l2<0)i=i+1;  
if (i==2)l1=(w1-tr)/(2*w1);  
if (i==2)l2=0;  
return l2;
}


}