ｄｓげ０９１１ - プログラム倉庫

import java.awt.*;
import java.awt.event.*;
class dsge0911 extends Frame {
    public static void main(String [] args) {
        Frame f=new dsge0911();
        f.setTitle("dsge0911");
        f.setSize(500,500);
        f.setBackground(Color.yellow);
        f.setVisible(true);
    }

dsge0911(){addWindowListener(new stopwin());}
class stopwin extends WindowAdapter{
    public void windowClosing(WindowEvent we){System.exit(0);}
    }

public void paint(Graphics g){
double a,beta,h,ks,ls,k1,c1,l1,w1,r1;  
double k[]=new double[101];
double cx[]=new double[101];
double cxs[]=new double[101];
double lx[]=new double[101];
double lxs[]=new double[101];
int kp[]=new int[101];  
int cp[]=new int[101];
double maxc,minc,maxk,mink;
double n1;
int t,n,n2,n3;  
double ep;  
a=0.33;
beta=0.95;
ls=(1-a)/(2-a);
ks=ls*Math.pow((1 / beta - 1) / a , 1 / (a - 1));
h=2*ks/100;
for (n=1;n<101;n++){
k[n]=n*h;
lx[n]=ls;
cx[n]=Math.pow(k[n],a)*Math.pow(ls,1-a);
}
t=0;
while(t<100){
for (n=10;n<91;n++){
k1=k[n]+Math.pow(k[n],a)*Math.pow(lx[n],1-a)-cx[n];
n1=k1/h;
n2=(int)n1;
n3=n2+1;
c1=cx[n2]+(n1-n2)*(cx[n3]-cx[n2]);
l1=cx[n2]+(n1-n2)*(cx[n3]-cx[n2]);
r1=a*Math.pow(k1,a-1)*Math.pow(l1,1-a);
cxs[n]=c1/(beta*(1+r1));
w1=(1-a)*Math.pow(k1,a)*Math.pow(l1,-a);
lxs[n]=1-cx[n]/w1;
}
ep=0;
for (n=10;n<91;n++){
ep=ep+Math.pow(cx[n]-cxs[n],2)+Math.pow(lx[n]-lxs[n],2);
}
for (n=10;n<91;n++){
cx[n]=cxs[n];
lx[n]=lxs[n];
}
if (ep<0.0001){
t=1000;
}
t=t+1;
}

maxk=-999;
for (n=10;n<91;n++){
if (k[n]>maxk)maxk=k[n];
}

mink=999;
for (n=10;n<91;n++){
if (k[n]<mink)mink=k[n];
}

maxc=-999;
for (n=10;n<91;n++){
if (cx[n]>maxc)maxc=cx[n];
}

minc=999;
for (n=10;n<91;n++){
if (cx[n]<minc)minc=cx[n];
}


for (n=10;n<91;n++){
cp[n]=50+(int)(400*(cx[n]-minc)/(maxc-minc));
}


for (n=10;n<91;n++){
kp[n]=450-(int)(400*(k[n]-mink)/(maxk-mink));
}

g.setColor(Color.green);
g.drawString("DSGE0911",300,100);
g.setColor(Color.red);  
g.drawLine(50,50,50,450);
g.drawLine(50,450,450,450);  
g.setColor(Color.blue);
for (n=10;n<90;n++){
g.drawLine(kp[n],cp[n],kp[n+1],cp[n+1]);
}  


}
}