@@ -0,0 +1,929 @@
+package ru.nivanov;%0A%0Aimport static java.lang.Math.*;%0A%0Apublic class PersonalTask %7B%0A%09int%5B%5D first;%0A%09int%5B%5D second;%0A%09%0A%09public PersonalTask (int%5B%5D first, int%5B%5D second) %7B%0A%09%09this.first = first;%0A%09%09this.second = second;%0A%09%7D%0A%09%0A%09public int%5B%5D sortedMass () %7B%0A%09%09%0A%09%09int%5B%5D result = new int %5Bthis.first.length + this.second.length%5D;%0A%09%09%09%0A%09%09int indexFirst = 0;%0A%09%09int indexSecond = 0;%0A%09%09int count = 0;%0A%09%09int naibol = Math.max(first%5Bthis.first.length-1%5D,second%5Bthis.second.length-1%5D);%0A%09%09%09%09%09%0A%09%09int%5B%5D tempMass = new int%5Bnaibol + 1%5D;%0A%09%09%09%0A%09%09for (int i = 0; i %3C (this.first.length);i++) %7B%0A%09%09%09for (int j = 0; j %3C (this.second.length);j++) %7B%0A%09%09%09%09indexFirst = this.first%5Bi%5D;%0A%09%09%09%09tempMass%5BindexFirst%5D = indexFirst; %0A%09%09%09%09indexSecond = this.second%5Bj%5D;%0A%09%09%09%09tempMass%5BindexSecond%5D = indexSecond; %0A%09%09%09%7D%0A%09%09%7D%0A%09%09%09%09%0A%09%09for (int k = 0; k %3C (naibol+1); k++ ) %7B%0A%09%09%09if (tempMass%5Bk%5D != 0) %7B%0A%09%09%09%09result%5Bcount%5D = tempMass%5Bk%5D;%0A%09%09%09%09count++;%0A%09%09%09%7D%0A%09%09%09%0A%09%09%7D%0A%09%0A%09return result;%09%0A%09%7D%0A%09%09%0A%7D

add personal task