Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static void main(String[] args)
- {
- int[] val = new int[999];
- recurse(val , 0 , 999 , 1);
- System.out.println(Arrays.toString(val));
- float avg = 0;
- float per = 0;
- for(int i=0 ; i<999 ; i++)
- {
- avg += val[i];
- if(val[i] < 8)
- per++;
- }
- System.out.println(avg/999);
- System.out.println(per/999);
- val = new int[999];
- for(int i=1 ; i<1000 ; i++)
- {
- int huns = i % 1000 / 100;
- int tens = i % 100 / 10;
- int ones = i % 10 / 1;
- if(i % 100 == 0)
- val[i-1] = huns;
- else if(i % 10 == 0)
- val[i-1] = huns + tens + 1;
- else
- val[i-1] = huns + tens + ones + 2;
- System.out.printf("%4d %4d\n", i , val[i-1]);
- }
- System.out.println(Arrays.toString(val));
- avg = 0;
- per = 0;
- for(int i=0 ; i<999 ; i++)
- {
- avg += val[i];
- if(val[i] < 10)
- per++;
- }
- System.out.println(avg/999);
- System.out.println(per/999);
- }
- public static void recurse(int[] val , int min , int max , int depth)
- {
- int mid = (max+min)/2;
- if(max > min)
- {
- val[mid] = depth;
- recurse(val , min , mid , depth+1);
- recurse(val , mid+1 , max , depth+1);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment