たたかう - 経済統計練習帳

package ren;
 
 
public class pro {
 
    int[] a=new int[50];
    int[] b=new int[50];
    int[] c=new int[50];
 
    int[] point_h=new int[50];
    int[] point_u=new int[50];
   int number,number_h,number_u;
 
 
    public static void main(String[] args) {
        pro test=new pro();
    }
 
    pro(){
 
 
        a[1]=1;
        b[1]=1;
        c[1]=300;
        a[2]=1;
        b[2]=2;
        c[2]=20;
 
        a[3]=2;
        b[3]=1;
        c[3]=50;
        a[4]=2;
        b[4]=2;
        c[4]=100;
        a[5]=2;
        b[5]=3;
        c[5]=50;
 
        a[6]=3;
        b[6]=2;
        c[6]=50;
        a[7]=3;
        b[7]=3;
        c[7]=150;
 
        point_u[1]=100;
        point_u[2]=0;
        point_u[3]=0;
 
 
        number=7;
 
        number_h=3;
        number_u=3;
 
        int trs;
 
        for(trs=1;trs<11;trs++){
 
 
        int s,sx,tx;
        int[] sub_u=new int[60];
        int[] sub_h=new int[60];
        int[] sub_c=new int[60];
        int subnumber;
 
        for(s=1;s<number_h+1;s++){
        tx=0;
         for(sx=1;sx<number+1;sx++){    
        if(a[sx]==s)tx=tx+1;    
        if(a[sx]==s)sub_u[tx]=b[sx];    
        if(a[sx]==s)sub_c[tx]=c[sx];    
            }
        subnumber=tx;
        int s1=0;
        int s2=0;
        for(sx=1;sx<subnumber+1;sx++){  
        s1=s1+sub_c[sx];
        int s3=sub_u[sx];
        s2=s2+sub_c[sx]*point_u[s3];
         }
        point_h[s]=s2/s1;
        }
 
        int maxpoint=0;
        for(s=1;s<number_h+1;s++){
        if(point_h[s]>maxpoint)maxpoint=point_h[s];    
        }
 
        int minpoint=100;
        for(s=1;s<number_h+1;s++){
        if(point_h[s]<minpoint)minpoint=point_h[s];    
        }
 
 
        for(s=1;s<number_h+1;s++){
        point_h[s]=100*(point_h[s]-minpoint)/(maxpoint-minpoint);    
 
        }
 
 
 
 
        for(s=1;s<number_u+1;s++){
        tx=0;
         for(sx=1;sx<number+1;sx++){    
        if(b[sx]==s)tx=tx+1;    
        if(b[sx]==s)sub_h[tx]=a[sx];    
        if(b[sx]==s)sub_c[tx]=c[sx];    
            }
        subnumber=tx;
        int s1=0;
        int s2=0;
        for(sx=1;sx<subnumber+1;sx++){  
        s1=s1+sub_c[sx];
        int s3=sub_h[sx];
        s2=s2+sub_c[sx]*point_h[s3];
         }
        point_u[s]=s2/s1;
        }
 
        maxpoint=0;
        for(s=1;s<number_u+1;s++){
        if(point_u[s]>maxpoint)maxpoint=point_u[s];    
        }
 
       minpoint=100;
        for(s=1;s<number_u+1;s++){
        if(point_u[s]<minpoint)minpoint=point_u[s];    
        }
 
 
        for(s=1;s<number_u+1;s++){
        point_u[s]=100*(point_u[s]-minpoint)/(maxpoint-minpoint);    
 
        }
 
        }
 
        int s;
        for(s=1;s<4;s++){
        System.out.println(point_u[s]);    
        }
 
        for(s=1;s<4;s++){
        System.out.println(point_h[s]);    
        }
 
    }
 
 
}