ｄがめ２１ - プログラム倉庫

class pro{
public static void main(String args[]){
double a,beta;
double ks,h;
double gov;
int n;
double[] k=new double[101];
double[] cx=new double[101];
double[] cxs=new double[101];
double[] v=new double[101];
double[] vs=new double[101];
double[] tk=new double[101];
double[] vp=new double[3];
double[] tkp=new double[3];
double[] tks=new double[101];
double n1;
int n2,n3;
double c1,r1,tk1,k1;
double ep;
int t1,t2,t3,t4,t5;
double u1,v1;
int s;
double z;
double cp,cps,maxv;
a=0.33;
beta=0.95;
ks=Math.pow((1 / beta - 1) / a , 1 / (a - 1));
h=2*ks/100;
for (n=1;n<101;n++){
k[n]=n*h;
cx[n]=Math.pow(k[n],a);
tk[n]=0.2;
}
z=0.1;
t5=0;
while(t5<5){
z=z/2;
t4=0;
while(t4<100){
t1=0;
while(t1<100){
for (n=10;n<91;n++){
gov=tk[n]*a*+Math.pow(k[n],a);
k1=k[n]+Math.pow(k[n],a)-cx[n]-gov;
n1=k1/h;
n2=(int)n1;
n3=n2+1;
c1=cx[n2]+(n1-n2)*(cx[n3]-cx[n2]);
tk1=tk[n2]+(n1-n2)*(tk[n3]-tk[n2]);
r1=(1-tk1)*a*Math.pow(k1,a-1);
cxs[n]=c1/(beta*(1+r1));
}
ep=0;
for (n=10;n<91;n++){
ep=ep+Math.pow(cx[n]-cxs[n],2);
}
for (n=10;n<91;n++){
cx[n]=cxs[n];
}
if (ep<0.001)t1=1000;
t1=t1+1;
}

for (n=1;n<101;n++){
v[n]=Math.log(cx[n])/(1-beta);
}
t2=0;
while(t2<100){
for (n=10;n<91;n++){
gov=tk[n]*a*Math.pow(k[n],a);
u1=Math.log(cx[n])+0.1*Math.log(gov);
k1=k[n]+Math.pow(k[n],a)-cx[n]-gov;
n1=k1/h;
n2=(int)n1;
n3=n2+1;
v1=v[n2]+(n1-n2)*(v[n3]-v[n2]);
vs[n]=u1+beta*v1;
if (n1<10)vs[n]=-999;
if (n1>90)vs[n]=-999;
}
ep=0;
for (n=10;n<91;n++){
ep=ep+Math.pow(vs[n]-v[n],2);
}
for (n=10;n<91;n++){
v[n]=vs[n];
}
if (ep<0.001)t2=1000;
t2=t2+1;
}
for (n=10;n<91;n++){
for (s=-1;s<2;s++){
tkp[s+1]=tk[n]+z*s;
if(tkp[s+1]>0.99)tkp[s+1]=0.99;
cp=cx[n];
t3=0;
while(t3<100){
gov=tkp[s+1]*a*Math.pow(k[n],a);
k1=k[n]+Math.pow(k[n],a)-cp-gov;
n1=k1/h;
n2=(int)n1;
n3=n2+1;
c1=cx[n2]+(n1-n2)*(cx[n3]-cx[n2]);
tk1=tk[n2]+(n1-n2)*(tk[n3]-tk[n2]);
r1=(1-tk1)*a*Math.pow(k1,a-1);
cps=c1/(beta*(1+r1));
ep=Math.pow(cp-cps,2);
cp=cps;
if(ep<0.0001)t3=1000;
t3=t3+1;
}
gov=tkp[s+1]*a*Math.pow(k[n],a);
u1=Math.log(cp)+0.1*Math.log(gov);
k1=k[n]+Math.pow(k[n],a)-cp-gov;
n1=k1/h;
n2=(int)n1;
n3=n2+1;
v1=v[n2]+(n1-n2)*(v[n3]-v[n2]);
vp[s+1]=u1+beta*v1;
}
maxv=-999;
tks[n]=tk[n];
for (s=-1;s<2;s++){
if(vp[s+1]>maxv)tks[n]=tkp[s+1];
if(vp[s+1]>maxv)maxv=vp[s+1];
}
}
ep=0;
for (n=10;n<91;n++){
ep=ep+Math.pow(tks[n]-tk[n],2);
}
for (n=10;n<91;n++){
tk[n]=tks[n];
}

if (ep<0.001)t4=1000;
t4=t4+1;
}
t5=t5+1;
}
for (n=10;n<91;n++){
System.out.println(tk[n]);
}
}
}