From 5739dcacf01fb5e89f3abc084c11f7834887e49d Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 1 Aug 2019 00:00:30 +0300 Subject: [PATCH 01/70] first commit Task_1 --- .idea/.gitignore | 2 ++ .idea/2_Algorithmization.iml | 9 +++++++++ .idea/compiler.xml | 18 ++++++++++++++++++ .idea/misc.xml | 11 +++++++++++ .idea/modules.xml | 10 ++++++++++ .idea/vcs.xml | 6 ++++++ Task0/Task0.iml | 15 +++++++++++++++ Task0/pom.xml | 12 ++++++++++++ Task1/Task1.iml | 15 +++++++++++++++ Task1/pom.xml | 12 ++++++++++++ Task1/src/main/java/Task_1.java | 22 ++++++++++++++++++++++ Task1/target/classes/Task_1.class | Bin 0 -> 1267 bytes 12 files changed, 132 insertions(+) create mode 100644 .idea/.gitignore create mode 100644 .idea/2_Algorithmization.iml create mode 100644 .idea/compiler.xml create mode 100644 .idea/misc.xml create mode 100644 .idea/modules.xml create mode 100644 .idea/vcs.xml create mode 100644 Task0/Task0.iml create mode 100644 Task0/pom.xml create mode 100644 Task1/Task1.iml create mode 100644 Task1/pom.xml create mode 100644 Task1/src/main/java/Task_1.java create mode 100644 Task1/target/classes/Task_1.class diff --git a/.idea/.gitignore b/.idea/.gitignore new file mode 100644 index 0000000..5c98b42 --- /dev/null +++ b/.idea/.gitignore @@ -0,0 +1,2 @@ +# Default ignored files +/workspace.xml \ No newline at end of file diff --git a/.idea/2_Algorithmization.iml b/.idea/2_Algorithmization.iml new file mode 100644 index 0000000..d6ebd48 --- /dev/null +++ b/.idea/2_Algorithmization.iml @@ -0,0 +1,9 @@ + + + + + + + + + \ No newline at end of file diff --git a/.idea/compiler.xml b/.idea/compiler.xml new file mode 100644 index 0000000..2abff2a --- /dev/null +++ b/.idea/compiler.xml @@ -0,0 +1,18 @@ + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml new file mode 100644 index 0000000..a7ed169 --- /dev/null +++ b/.idea/misc.xml @@ -0,0 +1,11 @@ + + + + + + \ No newline at end of file diff --git a/.idea/modules.xml b/.idea/modules.xml new file mode 100644 index 0000000..94d5383 --- /dev/null +++ b/.idea/modules.xml @@ -0,0 +1,10 @@ + + + + + + + + + + \ No newline at end of file diff --git a/.idea/vcs.xml b/.idea/vcs.xml new file mode 100644 index 0000000..35eb1dd --- /dev/null +++ b/.idea/vcs.xml @@ -0,0 +1,6 @@ + + + + + + \ No newline at end of file diff --git a/Task0/Task0.iml b/Task0/Task0.iml new file mode 100644 index 0000000..62eef8f --- /dev/null +++ b/Task0/Task0.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task0/pom.xml b/Task0/pom.xml new file mode 100644 index 0000000..0d87b64 --- /dev/null +++ b/Task0/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + Algorithmization + Task#0 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task1/Task1.iml b/Task1/Task1.iml new file mode 100644 index 0000000..62eef8f --- /dev/null +++ b/Task1/Task1.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task1/pom.xml b/Task1/pom.xml new file mode 100644 index 0000000..eebeb7d --- /dev/null +++ b/Task1/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + Algorithmization + Task#1 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task1/src/main/java/Task_1.java b/Task1/src/main/java/Task_1.java new file mode 100644 index 0000000..f749cda --- /dev/null +++ b/Task1/src/main/java/Task_1.java @@ -0,0 +1,22 @@ +import java.util.Scanner; + +public class Task_1 { + public static void main(String[] args) { +// 1. В массив A [N] занесены натуральные числа. Найти сумму тех элементов, которые кратны данному К. + + Scanner scanner = new Scanner(System.in); + System.out.println("Enter a size of array:"); + int n = scanner.nextInt(); + int[] array = new int[n]; + System.out.println("Enter natural number k "); + int k = scanner.nextInt(); + for (int i = 0; i < array.length; i++) { + array[i] = (int) (Math.random() * 100); + System.out.print("|"+ array[i]); + if (k % array[i] == 0) + System.out.print("\n this number is multiple: " + array[i]); + + } + } + } + diff --git a/Task1/target/classes/Task_1.class b/Task1/target/classes/Task_1.class new file mode 100644 index 0000000000000000000000000000000000000000..0d2ecb6f87eb5cc8701bd66fd403c6f305c1ac8e GIT binary patch literal 1267 zcmaJ>*-{fh6g{0}GGQ`oSs)6^xQ8V~6j9kkHVuYFgIE++QB5+ykjW%YCYD&150(%5 z;s^NXi@wT3u*Bj6{3!Kyf)xbHsY>_sx#ym~r*CI|{`$TTpbtw5TF@gSR)=216}WI! zy!H8TO~G~a3*?3m0}5{9mUnEKlIW3fTR}Z~d>9n-kQj!=Fd~vheYhiIOvYUX@33JR z&M1RB+PTEwnaF2!hQ_2}>2syrnr<)hHItA)GN0z=61NSpJ^($=rcq?@B^P-yyV^HI z`8jS_3@y=>>$_$=BV~~q!Zdtlb@v2J6G0b?X z3eqNwc96Jj^KAy#3aPOygObXZ?6f{@h-&@Sf_g;_Dq0a?Xs* z+@r#$EJwFBt`&`!x|UzpD%%XoxUV9C85IwZWN59jEbf$SZfaKLptP(eV^+l+=819C z{dmbRGr|&krD6dO#qdZ)3X3WpV}_wk(Zp%~6{ELY$#jf@sSj$@rm7)^rke2l+LoSn z{((~4MMuxksfZ?otA}Ug;|Z%!a;OVB&(ZNkq9+DKd))aF3Dy!9sByK#U}bO8I|Ng= z3W8*c4G)BmHeIf!+=Wx8b4u7;Y2S?+9-JDXdXJk?F{Nm}wkLANptv6BRkU95wn zC1>r?MCX6PJ||zjiVUIXaUuyw6)!l4F#YSq;{x>(5gJd?Do!(_S?bya`&tQ~rqNpg z-DsnCwMsxc&d{n3XVF0jC9^Q`yo9~qgKK#Q?p=72JCFk2GUVywK?%X1{V-3QJ=8Dnq9M>&MiYg4%V;hmP)0E95zE3ybR1%ZjkY$r;B3!Xuud6@f1y1M>F0K_70(n;ZZUb!wNJy rHA&dRd0e2`kJprciOfgv43{bDBF!AGAPP6BuA-AL55>EP?Lzk-TQwMY literal 0 HcmV?d00001 From 38d49c802870f56a6c1bee0ae4e8eae0aa9d457a Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 1 Aug 2019 00:15:05 +0300 Subject: [PATCH 02/70] second commit Task_1 --- Task1/src/main/java/Task_1.java | 11 ++++++----- Task1/target/classes/Task_1.class | Bin 1267 -> 1320 bytes 2 files changed, 6 insertions(+), 5 deletions(-) diff --git a/Task1/src/main/java/Task_1.java b/Task1/src/main/java/Task_1.java index f749cda..c94a875 100644 --- a/Task1/src/main/java/Task_1.java +++ b/Task1/src/main/java/Task_1.java @@ -12,11 +12,12 @@ public static void main(String[] args) { int k = scanner.nextInt(); for (int i = 0; i < array.length; i++) { array[i] = (int) (Math.random() * 100); - System.out.print("|"+ array[i]); - if (k % array[i] == 0) - System.out.print("\n this number is multiple: " + array[i]); - + System.out.print("|" + array[i]); + } + for (int value : array) { + if (k % value == 0) + System.out.print("\n this number is multiple: " + value); } } - } +} diff --git a/Task1/target/classes/Task_1.class b/Task1/target/classes/Task_1.class index 0d2ecb6f87eb5cc8701bd66fd403c6f305c1ac8e..8319051496b0bb7f5c2d7bc5a4be1fc184c0819f 100644 GIT binary patch delta 458 zcmWlVO-~bH5XXN{ySvYJeacI5Q52IczEIF21zDhCc^4GrT@1%H)})DmRx}Y09OS^k z3)z!KFG`|UA*qQb{QxBT35*xMfC+c;*_q6LCiDN#WHLvIFV5z{zwcEb$9;!JvXYJj zSLt+!k&CJ>n{J0|^h6!srq`j5ersr14{4L+9g<{iu19$wf*TPOqM<>XA<3|0L|_e+ zR!i#zK|Is8BrrzT9u@^Vn}KD%2p&H#?)=&IM-^j?D^77!F~OvuaeQ^XSoQ+%S!tu_ ztv&LBayfXJm)ug^W=e5~yWxA$Y)va>m<_AKOU*H_m}5b)$UVgpQ~Q6#p-7BikZfJt!6S{S u6)oD+*wJB}=Yq~Bc*{jDAvnz&S~VM^nQbz(5vQFE9cc{BU)JgvSN;Q;WlZ`2 delta 404 zcmWlUNiRcT6o#L#z3sidzKW?TNL+IbrRKTjd7jgBAr(UeMb(zXiltmDzrYp?35mqU z!r$N@*jS10o|C+1c;E9T=idDBU3~t%ya7$DndDQi6ZX+Sqlt@%(={11o3zmCY}yRk zO*-iG4#d=v3Y{(!KlKLPPVI4^*MUCgC~DBJGoUjl@b>N{_tH^;J5;kK(1wq;wgopA z2}4Vyc25PlH}AQ&TkK~INroAb1R0f#F>arWqVR-dk}1hFGlJk~GQFL$l8N+LDsf;X z&ki@$xNqsqO6HiiKZKRDz@lVXBG&B!EtDV7!U0di z@f{_PcwX_xp2^I~vm;s{^Zr3;T@)&8$8X Date: Thu, 1 Aug 2019 18:45:25 +0300 Subject: [PATCH 03/70] second commit Task_1 --- Task1/src/main/java/Task_1.java | 18 ++++++++++++------ 1 file changed, 12 insertions(+), 6 deletions(-) diff --git a/Task1/src/main/java/Task_1.java b/Task1/src/main/java/Task_1.java index c94a875..501d7f4 100644 --- a/Task1/src/main/java/Task_1.java +++ b/Task1/src/main/java/Task_1.java @@ -1,23 +1,29 @@ +import java.util.Arrays; import java.util.Scanner; public class Task_1 { public static void main(String[] args) { -// 1. В массив A [N] занесены натуральные числа. Найти сумму тех элементов, которые кратны данному К. + // 1. В массив A [N] занесены натуральные числа. Найти сумму тех элементов, которые кратны данному К. Scanner scanner = new Scanner(System.in); System.out.println("Enter a size of array:"); int n = scanner.nextInt(); int[] array = new int[n]; System.out.println("Enter natural number k "); int k = scanner.nextInt(); - for (int i = 0; i < array.length; i++) { + + int sum = 0; + for (int i=0; i < array.length; i++) { array[i] = (int) (Math.random() * 100); - System.out.print("|" + array[i]); } - for (int value : array) { - if (k % value == 0) - System.out.print("\n this number is multiple: " + value); + System.out.print(Arrays.toString(array)+ "\n"); + + for (int i=0; i < array.length; i++) { + if (array[i] % k == 0) { + sum = sum + array[i]; + } } + System.out.print("The sum of elements that are multiples of "+ k + " is " + sum); } } From 45488402ffddc0e868fb59b519aa20b9b2d6613b Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 1 Aug 2019 19:36:55 +0300 Subject: [PATCH 04/70] first commit Task_2 --- .gitignore | 3 ++ .idea/compiler.xml | 2 ++ .idea/misc.xml | 1 + .idea/modules.xml | 1 + Task1/src/main/java/Task_1.java | 6 ++-- Task1/target/classes/Task_1.class | Bin 1320 -> 1446 bytes Task2/Task2.iml | 15 ++++++++++ Task2/pom.xml | 12 ++++++++ Task2/src/main/java/Task_2.java | 47 ++++++++++++++++++++++++++++++ 9 files changed, 84 insertions(+), 3 deletions(-) create mode 100644 .gitignore create mode 100644 Task2/Task2.iml create mode 100644 Task2/pom.xml create mode 100644 Task2/src/main/java/Task_2.java diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..02b99ba --- /dev/null +++ b/.gitignore @@ -0,0 +1,3 @@ +.idea/ +target/ +*.iml/ diff --git a/.idea/compiler.xml b/.idea/compiler.xml index 2abff2a..ab52c76 100644 --- a/.idea/compiler.xml +++ b/.idea/compiler.xml @@ -8,11 +8,13 @@ + + \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml index a7ed169..35d87a9 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -5,6 +5,7 @@ diff --git a/.idea/modules.xml b/.idea/modules.xml index 94d5383..3883473 100644 --- a/.idea/modules.xml +++ b/.idea/modules.xml @@ -5,6 +5,7 @@ + \ No newline at end of file diff --git a/Task1/src/main/java/Task_1.java b/Task1/src/main/java/Task_1.java index 501d7f4..ac0c0c6 100644 --- a/Task1/src/main/java/Task_1.java +++ b/Task1/src/main/java/Task_1.java @@ -18,9 +18,9 @@ public static void main(String[] args) { } System.out.print(Arrays.toString(array)+ "\n"); - for (int i=0; i < array.length; i++) { - if (array[i] % k == 0) { - sum = sum + array[i]; + for (int value : array) { + if (value % k == 0) { + sum = sum + value; } } System.out.print("The sum of elements that are multiples of "+ k + " is " + sum); diff --git a/Task1/target/classes/Task_1.class b/Task1/target/classes/Task_1.class index 8319051496b0bb7f5c2d7bc5a4be1fc184c0819f..ce0cdb2eb33efac57b149ce31e652cac2615a9fa 100644 GIT binary patch delta 828 zcmYLHNmCP15dK~!vt%*|33)(RWE9i{4FQ)3h^&I*hAg6pildG&k_^;jqUD8LC@+>& zQFEg_SRB-g2R#HztGIacS9tK`N&kS_6Arwp>HfN3_t(q359+&c@%!H|y8t>duc8he zGCD&ziBl>9IPIe|3Nk9rqRaPmE9g;i4!zRAEG5yAab86QI#l$b-$w%q27Nu`Ck-pO z;2R?fMrB--afw0dwQS4nV-OO_8Mg8KTTsXsa$Xl}O2$#o5P51mGtvdu%BH6t8MbXY zGR8Dq#uW{5T-9(5*S%HNP#o8A0}~o1F~v|jV!NiJ+lE_kjI3@Kau3N|(q&9*xQQ8x zDD!3wdm%mLI+ndKRIsv-efC=#Zev!%9n3K>)wk|yxQ7Xbw&_Jvr}p&aC%Tz6bEfU) zb$8Klb)&&C^;{wAS}R#I@8A0b_Zfn^mG^kycT3g&AcKx$yvQ>s?($x3hML6OSaRb} z%oBxfA(kk^q9A#_Li0Qhp_YDze*$1Mbv?-jveKj(X|Zh^>{I!=k)%|12GK-V+Y7)! zG?NvAPGsd|wn%X*`F6aYLaHcaBrc_Px4=_e+JPEFcxionO=9o={rU{?D=KEUaUivW z$`Y!g5fUXtOQ=ruNO5U5BMTXYD_q_}b6ny|dnUv~Jh-w6m5V&|AS13R#PnmIDHkiW?`_OAW~#IDbFF!wS02yu=Y{%9} zRg>nZL5NIXb?6*3=%g#~WOa@koS-{0FeyoLGnbd9Pj$_hHOrbuo(6I3ylc>Xd{0uLJQVs-o(p%E zKZg@h1>IlVqAkA&w@%T9C5sGB2&qj>WL$1((TZrbeI4c9W_X9l$fh$)i`eECfSn}d zR?RM2#Ushepx~;-_p01mWv^JOy|G5dw$u+8O+@D(kH1I#M9t(nwGDL@wn->ep}s;x zg~o@f^5)k!yGMAS)(JaT3RZrTUD06^o+!R6iq^5>Hi2cA^7^Y=N0;> zlV&uc=rl@WF$`%s%3c|vT^_%aS_TAjQ|xK#xkm#J1o>R-m$IK=*ip&1=^`l`Qw6bG uzBb{LA=x8L2;Woov0qjYW0eCE4M~+p#1C?auoSv0e;ZW-I4tlGM}7l-4tgp8 diff --git a/Task2/Task2.iml b/Task2/Task2.iml new file mode 100644 index 0000000..62eef8f --- /dev/null +++ b/Task2/Task2.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task2/pom.xml b/Task2/pom.xml new file mode 100644 index 0000000..aaaad29 --- /dev/null +++ b/Task2/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + Algoriyhmization + Task#2 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task2/src/main/java/Task_2.java b/Task2/src/main/java/Task_2.java new file mode 100644 index 0000000..5f8bb12 --- /dev/null +++ b/Task2/src/main/java/Task_2.java @@ -0,0 +1,47 @@ +import java.util.Arrays; +import java.util.Scanner; + +public class Task_2 { + + public static void main(String[] args) { + + // 2. Дана последовательность действительных чисел а1 ,а2 ,..., ап. Заменить все ее члены, большие данного Z, этим + // числом. Подсчитать количество замен. + Scanner scanner = new Scanner(System.in); + System.out.println("Enter a size of array:"); + int n = scanner.nextInt(); + int[] array = new int[n]; + System.out.println("Enter natural number z "); + int z = scanner.nextInt(); + int count=0; + for (int i=0; i < array.length; i++) { + array[i] = (int) (Math.random() * 100); + } + System.out.print(Arrays.toString(array)+ "\n"); + + for (int i=0; i < array.length; i++) { + if (array[i] > z ) { + array[i]=z; + ++count; + } + } + System.out.print(Arrays.toString(array)+ "\n" + "The amount of changing is " + count); + } + + + + + + + + + + + + + + + + + +} From aeb91356055b792630bc47f8be92f502343f71c4 Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 1 Aug 2019 19:43:10 +0300 Subject: [PATCH 05/70] first commit Task_3 --- .idea/compiler.xml | 2 ++ .idea/misc.xml | 1 + .idea/modules.xml | 1 + Task3/Task3.iml | 15 +++++++++++++++ Task3/pom.xml | 12 ++++++++++++ Task3/src/main/java/Task_3.java | 32 ++++++++++++++++++++++++++++++++ 6 files changed, 63 insertions(+) create mode 100644 Task3/Task3.iml create mode 100644 Task3/pom.xml create mode 100644 Task3/src/main/java/Task_3.java diff --git a/.idea/compiler.xml b/.idea/compiler.xml index ab52c76..17086b3 100644 --- a/.idea/compiler.xml +++ b/.idea/compiler.xml @@ -8,6 +8,7 @@ + @@ -15,6 +16,7 @@ + \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml index 35d87a9..18c50a1 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -6,6 +6,7 @@ diff --git a/.idea/modules.xml b/.idea/modules.xml index 3883473..7af7cb4 100644 --- a/.idea/modules.xml +++ b/.idea/modules.xml @@ -6,6 +6,7 @@ + \ No newline at end of file diff --git a/Task3/Task3.iml b/Task3/Task3.iml new file mode 100644 index 0000000..62eef8f --- /dev/null +++ b/Task3/Task3.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task3/pom.xml b/Task3/pom.xml new file mode 100644 index 0000000..af46faa --- /dev/null +++ b/Task3/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + Algorithmization + Task#3 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task3/src/main/java/Task_3.java b/Task3/src/main/java/Task_3.java new file mode 100644 index 0000000..5af40a1 --- /dev/null +++ b/Task3/src/main/java/Task_3.java @@ -0,0 +1,32 @@ +import java.util.Arrays; +import java.util.Scanner; + +public class Task_3 { + public static void main(String[] args) { + // Дан массив действительных чисел, размерность которого N. Подсчитать, сколько в нем отрицательных, + // положительных и нулевых элементов. + Scanner scanner = new Scanner(System.in); + System.out.println("Enter a size of array:"); + int n = scanner.nextInt(); + int[] array = new int[n]; + for (int i = 0; i < array.length; i++) { + array[i] = ((int) (Math.random() * 100) - 50); + } + System.out.print(Arrays.toString(array) + "\n"); + int countNegative = 0; + int countPositive = 0; + int countZero = 0; + for (int i = 0; i < array.length; i++) { + if (array[i] < 0) { + ++countNegative; + } else if (array[i] > 0) { + ++countPositive; + } else { + ++countZero; + } + } + System.out.println("Amount of negative numbers " + countNegative); + System.out.println("Amount of positive numbers " + countPositive); + System.out.println("Amount of zero " + countZero); + } +} From 4a50e9fa9f35a20fed3141a8469ddb6453fdb7ae Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 1 Aug 2019 23:07:20 +0300 Subject: [PATCH 06/70] first commit Task_4 --- .idea/compiler.xml | 2 ++ .idea/misc.xml | 1 + .idea/modules.xml | 1 + Task4/Task4.iml | 15 ++++++++++++++ Task4/pom.xml | 12 +++++++++++ Task4/src/main/java/Task_4.java | 36 +++++++++++++++++++++++++++++++++ 6 files changed, 67 insertions(+) create mode 100644 Task4/Task4.iml create mode 100644 Task4/pom.xml create mode 100644 Task4/src/main/java/Task_4.java diff --git a/.idea/compiler.xml b/.idea/compiler.xml index 17086b3..f2c8ef2 100644 --- a/.idea/compiler.xml +++ b/.idea/compiler.xml @@ -8,6 +8,7 @@ + @@ -17,6 +18,7 @@ + \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml index 18c50a1..bcbe23d 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -7,6 +7,7 @@ diff --git a/.idea/modules.xml b/.idea/modules.xml index 7af7cb4..59889c9 100644 --- a/.idea/modules.xml +++ b/.idea/modules.xml @@ -7,6 +7,7 @@ + \ No newline at end of file diff --git a/Task4/Task4.iml b/Task4/Task4.iml new file mode 100644 index 0000000..62eef8f --- /dev/null +++ b/Task4/Task4.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task4/pom.xml b/Task4/pom.xml new file mode 100644 index 0000000..27fce4b --- /dev/null +++ b/Task4/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + Algorithmization + Task#4 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task4/src/main/java/Task_4.java b/Task4/src/main/java/Task_4.java new file mode 100644 index 0000000..17e5587 --- /dev/null +++ b/Task4/src/main/java/Task_4.java @@ -0,0 +1,36 @@ +import com.sun.scenario.effect.impl.sw.java.JSWColorAdjustPeer; + +import java.util.Arrays; +import java.util.Scanner; + +public class Task_4 { + public static void main(String[] args) { + // 4. Даны действительные числа а 1 ,а 2 ,..., а n . Поменять местами наибольший и наименьший элементы. + + Scanner scanner = new Scanner(System.in); + System.out.println("Enter a size of array:"); + int n = scanner.nextInt(); + int[] array = new int[n]; + for (int i = 0; i < array.length; i++) { + array[i] = ((int) (Math.random() * 100) - 50); + } + System.out.print(Arrays.toString(array) + "\n"); + + //bobble sort + for (int i = array.length - 1; i > 0; i--) { + for (int j = 0; j < i; j++) { + if (array[j] > array[j + 1]) { + int a = array[j]; + array[j] = array[j + 1]; + array[j + 1] = a; + } + } + } + for (int i = 0; i < array.length; i++) { + int swap = array[0]; + array[0] = array.length; + array.length = swap; + } + System.out.print(Arrays.toString(array) + "\n"); + } +} From 3f03a2339998504120e2b4df9e0976cb77abdedd Mon Sep 17 00:00:00 2001 From: Eugene Date: Fri, 2 Aug 2019 19:38:48 +0300 Subject: [PATCH 07/70] first commit Task_4 --- Task4/src/main/java/Task_4.java | 27 ++++++++++++--------------- 1 file changed, 12 insertions(+), 15 deletions(-) diff --git a/Task4/src/main/java/Task_4.java b/Task4/src/main/java/Task_4.java index 17e5587..4473df9 100644 --- a/Task4/src/main/java/Task_4.java +++ b/Task4/src/main/java/Task_4.java @@ -1,4 +1,3 @@ -import com.sun.scenario.effect.impl.sw.java.JSWColorAdjustPeer; import java.util.Arrays; import java.util.Scanner; @@ -6,7 +5,6 @@ public class Task_4 { public static void main(String[] args) { // 4. Даны действительные числа а 1 ,а 2 ,..., а n . Поменять местами наибольший и наименьший элементы. - Scanner scanner = new Scanner(System.in); System.out.println("Enter a size of array:"); int n = scanner.nextInt(); @@ -16,21 +14,20 @@ public static void main(String[] args) { } System.out.print(Arrays.toString(array) + "\n"); - //bobble sort - for (int i = array.length - 1; i > 0; i--) { - for (int j = 0; j < i; j++) { - if (array[j] > array[j + 1]) { - int a = array[j]; - array[j] = array[j + 1]; - array[j + 1] = a; - } - } - } + int max,min,swap; + max=0; + min=0; for (int i = 0; i < array.length; i++) { - int swap = array[0]; - array[0] = array.length; - array.length = swap; + if(array[max]array[i]) + min=i; } + System.out.println("max "+ array[max]+ " min "+ array[min]); + swap=array[max]; + array[max]=array[min]; + array[min]=swap; System.out.print(Arrays.toString(array) + "\n"); } } + From 3c7531b67617cf80be752486eb13ea2701409e41 Mon Sep 17 00:00:00 2001 From: Eugene Date: Fri, 2 Aug 2019 20:51:23 +0300 Subject: [PATCH 08/70] first commit for Task_5 --- .idea/compiler.xml | 6 ++++-- .idea/misc.xml | 1 + .idea/modules.xml | 1 + Task4/src/main/java/Task_4.java | 2 +- Task5/Task5.iml | 15 +++++++++++++++ Task5/pom.xml | 12 ++++++++++++ Task5/src/main/java/Task_5.java | 23 +++++++++++++++++++++++ 7 files changed, 57 insertions(+), 3 deletions(-) create mode 100644 Task5/Task5.iml create mode 100644 Task5/pom.xml create mode 100644 Task5/src/main/java/Task_5.java diff --git a/.idea/compiler.xml b/.idea/compiler.xml index f2c8ef2..0ee6b2e 100644 --- a/.idea/compiler.xml +++ b/.idea/compiler.xml @@ -6,11 +6,12 @@ - - + + + @@ -19,6 +20,7 @@ + \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml index bcbe23d..8cb8146 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -8,6 +8,7 @@ diff --git a/.idea/modules.xml b/.idea/modules.xml index 59889c9..903af5e 100644 --- a/.idea/modules.xml +++ b/.idea/modules.xml @@ -8,6 +8,7 @@ + \ No newline at end of file diff --git a/Task4/src/main/java/Task_4.java b/Task4/src/main/java/Task_4.java index 4473df9..d2f4c12 100644 --- a/Task4/src/main/java/Task_4.java +++ b/Task4/src/main/java/Task_4.java @@ -10,7 +10,7 @@ public static void main(String[] args) { int n = scanner.nextInt(); int[] array = new int[n]; for (int i = 0; i < array.length; i++) { - array[i] = ((int) (Math.random() * 100) - 50); + array[i] = (int) (Math.random() * 100) - 50; } System.out.print(Arrays.toString(array) + "\n"); diff --git a/Task5/Task5.iml b/Task5/Task5.iml new file mode 100644 index 0000000..62eef8f --- /dev/null +++ b/Task5/Task5.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task5/pom.xml b/Task5/pom.xml new file mode 100644 index 0000000..e3c1ec8 --- /dev/null +++ b/Task5/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + 2_Algorithmization + Task#5 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task5/src/main/java/Task_5.java b/Task5/src/main/java/Task_5.java new file mode 100644 index 0000000..8ab14f9 --- /dev/null +++ b/Task5/src/main/java/Task_5.java @@ -0,0 +1,23 @@ +import java.util.Arrays; +import java.util.Scanner; + +public class Task_5 { + public static void main(String[] args) { + //5. Даны целые числа а 1 ,а 2 ,..., а n . Вывести на печать только те числа, для которых а i > i. + Scanner scanner = new Scanner(System.in); + System.out.println("Enter a size of array:"); + int n = scanner.nextInt(); + int[] array = new int[n]; + for (int i = 0; i < array.length; i++) { + array[i] = (int) (Math.random() * 100) - 50; + } + System.out.print(Arrays.toString(array) + "\n"); + + for (int value : array) { + if (value > array.length) { + System.out.print(value + ","); + ; + } + } + } +} From 6218aa5bbb3d5781a9bb86414cb9d3b7a81bfcc8 Mon Sep 17 00:00:00 2001 From: Eugene Date: Sun, 4 Aug 2019 18:30:59 +0300 Subject: [PATCH 09/70] first commit Task_6 --- .idea/compiler.xml | 2 ++ .idea/misc.xml | 1 + .idea/modules.xml | 1 + Task6/Task6.iml | 15 +++++++++++++++ Task6/pom.xml | 12 ++++++++++++ Task6/src/main/java/Task_6.java | 31 +++++++++++++++++++++++++++++++ 6 files changed, 62 insertions(+) create mode 100644 Task6/Task6.iml create mode 100644 Task6/pom.xml create mode 100644 Task6/src/main/java/Task_6.java diff --git a/.idea/compiler.xml b/.idea/compiler.xml index 0ee6b2e..d2573d8 100644 --- a/.idea/compiler.xml +++ b/.idea/compiler.xml @@ -6,6 +6,7 @@ + @@ -21,6 +22,7 @@ + \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml index 8cb8146..a24dae4 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -9,6 +9,7 @@ diff --git a/.idea/modules.xml b/.idea/modules.xml index 903af5e..26c6637 100644 --- a/.idea/modules.xml +++ b/.idea/modules.xml @@ -9,6 +9,7 @@ + \ No newline at end of file diff --git a/Task6/Task6.iml b/Task6/Task6.iml new file mode 100644 index 0000000..62eef8f --- /dev/null +++ b/Task6/Task6.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task6/pom.xml b/Task6/pom.xml new file mode 100644 index 0000000..f0ecee0 --- /dev/null +++ b/Task6/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + Algorithmization + Task#6 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task6/src/main/java/Task_6.java b/Task6/src/main/java/Task_6.java new file mode 100644 index 0000000..b3ff6df --- /dev/null +++ b/Task6/src/main/java/Task_6.java @@ -0,0 +1,31 @@ +import java.util.Arrays; +import java.util.Scanner; + +public class Task_6 { + public static void main(String[] args) { + // 6. Задана последовательность N вещественных чисел. Вычислить сумму чисел, порядковые номера которых + // являются простыми числами. + Scanner scanner = new Scanner(System.in); + System.out.println("Enter a size of array:"); + int n = scanner.nextInt(); + double[] array = new double[n]; + for (int i = 0; i < array.length; i++) { + array[i] = (int) (Math.random() / 1 * 10) - 5; + } + System.out.print(Arrays.toString(array) + "\n"); + + double sum = 0; + nextPrime: + for (int i = 2; i <= n; i++) { + for (int j = 2; j < i; j++) { + if (i % j == 0) { + continue nextPrime; + } + } + sum += array[i]; + System.out.println("Prime number " + i + " element of array " + array[i]); + } + System.out.println("sum is " + sum); + } +} + From 4ea9cc44a3706d51fc3fd05f7a93f045ab1cadfb Mon Sep 17 00:00:00 2001 From: Eugene Date: Sun, 4 Aug 2019 21:29:24 +0300 Subject: [PATCH 10/70] first commit Task_7 --- .idea/compiler.xml | 30 ++++++ .idea/misc.xml | 17 ++++ .idea/modules.xml | 16 ++++ .idea/workspace.xml | 154 ++++++++++++++++++++++++++++++ Task2/target/classes/Task_2.class | Bin 0 -> 1404 bytes Task3/target/classes/Task_3.class | Bin 0 -> 1538 bytes Task4/target/classes/Task_4.class | Bin 0 -> 1455 bytes Task5/target/classes/Task_5.class | Bin 0 -> 1288 bytes Task6/target/classes/Task_6.class | Bin 0 -> 1482 bytes Task7/Task7.iml | 15 +++ Task7/pom.xml | 23 +++++ Task7/src/main/java/Task_7.java | 42 ++++++++ Task7/target/classes/Task_7.class | Bin 0 -> 1824 bytes 13 files changed, 297 insertions(+) create mode 100644 .idea/compiler.xml create mode 100644 .idea/misc.xml create mode 100644 .idea/modules.xml create mode 100644 .idea/workspace.xml create mode 100644 Task2/target/classes/Task_2.class create mode 100644 Task3/target/classes/Task_3.class create mode 100644 Task4/target/classes/Task_4.class create mode 100644 Task5/target/classes/Task_5.class create mode 100644 Task6/target/classes/Task_6.class create mode 100644 Task7/Task7.iml create mode 100644 Task7/pom.xml create mode 100644 Task7/src/main/java/Task_7.java create mode 100644 Task7/target/classes/Task_7.class diff --git a/.idea/compiler.xml b/.idea/compiler.xml new file mode 100644 index 0000000..e719dd0 --- /dev/null +++ b/.idea/compiler.xml @@ -0,0 +1,30 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml new file mode 100644 index 0000000..45b72c8 --- /dev/null +++ b/.idea/misc.xml @@ -0,0 +1,17 @@ + + + + + + \ No newline at end of file diff --git a/.idea/modules.xml b/.idea/modules.xml new file mode 100644 index 0000000..948f8e8 --- /dev/null +++ b/.idea/modules.xml @@ -0,0 +1,16 @@ + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/.idea/workspace.xml b/.idea/workspace.xml new file mode 100644 index 0000000..0b83242 --- /dev/null +++ b/.idea/workspace.xml @@ -0,0 +1,154 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + 1564602937435 + + + 1564607705938 + + + + + + + + + \ No newline at end of file diff --git a/Task2/target/classes/Task_2.class b/Task2/target/classes/Task_2.class new file mode 100644 index 0000000000000000000000000000000000000000..737c39cf1c603bbec74187f098768d0530e419e7 GIT binary patch literal 1404 zcmZux+inwA6kW%+aVA49P7Dc2+bQMZBy|k51WJGsLTC+60yqRhiqMHO!~^zBG#(>} zs#cYd`qWDNKpzlN+sE?YAcFD%d1V_YU&AIHe*1oKLJa68=+5~V6Kk3+q zQ4P5^9K|sm5gb>mZ<6>{#|exn%gH28>G%$(6XzF5;-g_)#~zI8ID@llbuNkT)qGx& zCX%?IHj^4IYM2s8oUt9-KPM2)49yF~Cf#LAptE2*)=a&+WO;LPsX|Mt;Fe@%UV66L zZy95L*{%sB3v;se;O_Bp@~hHz1ombY3-{$inX5==C0F!4+gTY`{)NpqPn`5t$n0qW z6VPfU={T0h^UzD(w=20~Xk-w<2yy9o^07c11_4JEhk_yT&-t$QWwlC83C4-*?z zxftj}zd(18*G`WbE*ba%KPo`pz-3%v0aK1|d8RaL_L^n7_sk&NX$=Jf)0im_r zLX;!@x+g2969{ImnHsJcxQ-$bpQ>=7ZdaBqPs5yn8<;n66Sr7^u67FsZevDZK%XmH zrmU)hRP0ijDpEnyu9=Fk$hL)r33N3B%r4!xN>pHnsrb0&TUDy0nvxF1wB20ZS*`o* ziY2R*voF)~K(#CC*6FZGyvjy4i9JDV`rBb<_f{3Cq5^I?{`3-Pj`hgTt7h@iv3(uQ z8m6URW_6x)mR;t}^NZUB1udIUT~}Amcf(s1+_n7B?%PH$a&^^mmIbn{^4P`L>I?&q+rJx#EWAK;9kId-#8Zg|w2=mqX9r*FGs@7mWf+S^$KuhkL^_e( ze1>#3op=eo7wr%JoPClIfB*lE;0^3qSVu?pB|01EN_BH+Ak{$6N8SK=qv_al7+j=d zvrpn8V87kX?j<`NZy+7IXcl-GDJHI?oxdKI*vGHWAUbdmoft+JvgpQ1VkSA~(F=?E zxm55Gk-t#A-?;ysjDIML66rdU{0R0_=K~a_Op(GB#lctf3dZ>hhj5tE_2DUw5Emiy c4`eWeC}aN0_W)vy{4++liWB)Yc@bnk0J-ltBme*a literal 0 HcmV?d00001 diff --git a/Task3/target/classes/Task_3.class b/Task3/target/classes/Task_3.class new file mode 100644 index 0000000000000000000000000000000000000000..1018e46ac0f02e95be81a0ab1891b9232550b2bd GIT binary patch literal 1538 zcmZux+jA3D9R5zS$!@k=+9pk@QYGFn1=Dbms1%TL(`aamsbE_WPm{H5Np|CAgTgpE z<8;O+{R`eBY-{t#$*UfML{P+OC0bDUL ziTyebq;L?2OvLc2x*ax9GVvN-SDH6W9Kmez#4-_lbR0EdVZVuEIIeDQ8aScOIfXcB z;FJbOpDTp*sGz968T^6Iw0NX2pO`A&1q_Lt;ZgPL^3tI5U% z={rj9DYf9L(-tr)OR|0K%Ar}}o6>OwCi1J54S8J_8`51bRs-L0*Jl;KaQG|JPx|Xb zW(K$k=bDJ!NMZWTX+vu9ZMG82dm!scrQ+NoJQUDbzHRY0hTSSV3l>5O1fm> zGR_O^nro`66uH~0Ea!$JY3CH+!$(|Ny<-1&;Sl=-H(7d)!;Z=o80{ytu(n~>f=5)< z8|}buvbSoK*=PigS1h}&PQY2(vdJM#<_8+okmFv5gni&5$KMBL!r0{7rsm9B%Bi6O z_J|)}9o@A*3(78;xvCucj(!d2WN?+$`O>X>%$xSp4+{zhIj43-Eo$IJyBKb0dHTs6 zC5vpeY_~2@7?j5oh~6aGkn#LLzC>7nAg4?Jy>7Z)Wq$7|EB+aSj$@&F5JV8E=JO$e04F_MViof zDG@Iv<0U<-D~>&dtUmJ{QVNTV627O9ppe{5icOu2fAksC8B%4nF2+MXeVZk#EQvvu z31wjgJxsqRE0|!d28P&!4AkG}5T@9jJs8Gep0gOiMU3*x8RG|*#z*wpz&JiZ7M~LP z1xK*S)_+a?H$>iMcYk45|72fPpD&SjH}%is1!$;YZ+O#HfAJz-;yHxh8SQ0ue-ghU mPrn%bf5tR@mUR1N}joM=bm%#J$L-azxN*j_y7wQ zwjn3+ejg9}EyVDlwhkn5&_W&`Y0n`GhjAovVwMPg5|b8eM`B;$yv^(1?>s zoYIHWNt}^5D{)RBan$p@@VG!cGd3e&oUT_~fq|muyHl;&q8m)B#VS3iVtq+fXH?+n z^SaXruX;^^WN}(GuYYx5lK7hPe1WZ*`QkNoL*=TvOef*DK|1nQ8AIco34M8j6<7IYGjwazK=snRwyEuiTk4B^f~#gJad8r*E_P!rU2WzlCD?aAwHSg$G5e{Ljd!sL2f0sT0GE-% z9B&sejAb|oh`GT5e9!0~==+)a{e~U*oyf=7i6_+dZz`+xz7lCX%8~7cfv+(hSyJna zx3PzNKmNiy%%=zW40{a1TQH22fdCGu z-ADun4IIK@Wf?V)#*y%;c}DQlanyi`Ap^%Srgq~I99QcJ6)~Z9CnGqe-ZA_!NkCvfOfW+w*@w59oL?&tSs8ztXwS663rHuWMNKvjykU!HUExN7KmhLW%=H% z(Q(GFNXHfEPAp{a%KI`^knVCS=X;L3Jg)GC!;ujP-Is+5VKwP36QQ$-yMSI^lCEoe zysx8Ge5a7g)s0Lhm?{s1TkAy)t2#{dASTdJtLaY^9cN9P z!=!SUGI1UkSp1~x+g@D8%g$pvUc4Qzr5MwZF>w)>Ok{Cc$FzwVToLH`m*<&^Q^?z% zj;kiFA!lM1*IBEfPID%1D1=$uq-luq*NYTrZ@|nf-nEzfzf8GDW#3*QOC_#V7sDy0 zGH$8jQ(arGP>xul>4lO#Sga7R5qO0U(g^IVE?^9oA>872-W02tzJ#Fj$f>IN3CZv1OImoQDmuPyLo|RvpW8Z zSl6F|bS0YNg=)kE`Vvj@ZA7CV7XLl<1;AHEjB_tfDXxNRX#Xn2``Yyu&f%I-!&dIi zx&!*Kji(lD#|~N;EOyf`Lfh-l2+V&#a1~ni147Yo75ZQmkrRDijOk!nv$W*e8^n^9 z_7N>zFz&r*KbW6+riphyztjIS%=uMpN`6FJ6`P~&oT})kBAOi2dbPE5D3}ggVJq|o zBfXjx9!~3)o?Ls2ZH-t?ONVuH$H9 zE4QPB4m>~t<8 literal 0 HcmV?d00001 diff --git a/Task6/target/classes/Task_6.class b/Task6/target/classes/Task_6.class new file mode 100644 index 0000000000000000000000000000000000000000..d541903657e6c9eb2c0328e07169d625704108c9 GIT binary patch literal 1482 zcmZuwO>^5+6g|(DB}Gw_){YWW3{|0k)8d-&;WkZE`jHk4Zd&3H2my*>i$tj{d1M)A zS1d9EZ1@2z%c3iWX{U8ElQO6~DzNO=B4P_1Q2&kt$-;2%&B=eI?0?LJ;?h1@nJl~z~G*{hl(OGR!ldc3c zr?KROp1kiUm1x~-3+RDl$MXfo^DC7N=L@IUaQwAmH3~g{ZARh?k8hdp z27R4yjnSC_t^!)S=J>uF(%wVrL|&swR$DH+wE6V}{I zo~(PgSK4t|jfsPJTHruj*={@y@0zIKvUHd?aRpb|!bLxFL))?2-c8pIKDXm!r!>50 zVgXeXi+Eqdl8F!Sp}@qG-Jb7wjk+6ZST^wyR!n@1PgtHIZ=agDhN{3w+iSKOuI!zKztgnT(>CbZB)ExbCY{FjVMm5<@$Aj!k{|# zMC?q9gpB0};-%uo1akTEUVA?}mmg5hzh)dpmVdT<5)g71`OWcGODQR9fvqJJy9hoBLIpPnHx* zDLlM|g9S_3#?WXm2IKnodi|S)O-0=P`w=4^z+B$KzQQ&}x)@FG=ckJUU8F~*l~hT! z)ZCA#rb?QnS?Vo}S*oSAet>!#CpR@hJkBZwOP#7sD}AhVh9DLz8B1G~q`iyr7**R; z8T8XG-wAqTmH+I09_Eo@e>#TQcLoMY9A@VxUc^3};5my?EF;ao$AXJ-1em~=^tws; zYm)pOy?>_dKH2+&{7F6+h-2tslE(jXDb}fyQD%6F=P-Ul9+Tudi)|dG ZUxJADa11Xa$*d6yI8GG7LCVp-@(&2eOPl}z literal 0 HcmV?d00001 diff --git a/Task7/Task7.iml b/Task7/Task7.iml new file mode 100644 index 0000000..9b55f7d --- /dev/null +++ b/Task7/Task7.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task7/pom.xml b/Task7/pom.xml new file mode 100644 index 0000000..d802774 --- /dev/null +++ b/Task7/pom.xml @@ -0,0 +1,23 @@ + + + 4.0.0 + + Algorithmization + Task#7 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 8 + 8 + + + + + + \ No newline at end of file diff --git a/Task7/src/main/java/Task_7.java b/Task7/src/main/java/Task_7.java new file mode 100644 index 0000000..d651cd7 --- /dev/null +++ b/Task7/src/main/java/Task_7.java @@ -0,0 +1,42 @@ +import java.util.Arrays; +import java.util.Scanner; + +public class Task_7 { + public static void main(String[] args) { + + // char[] charArray = { 'q', 'w', 'e', ';', 'r', 't', 'y' }; //массив символов + // String str = new String(charArray); //из массива символов формируется строка + // String[] stringArray = str.split(';', "gkl;jk"); //из строки формируется массив строк. Разделитель - символ ';' + // String str2 = String.join(";", stringArray); //массив строк объединяется в строку с добавлением разделителя ';' + // char[] charArray1 = str2.toCharArray(); //из строки формируется массив символов + + // 7. Даны действительные числа //a a an , , , 1 2 . Найти max( , , , ) + + Scanner scanner = new Scanner(System.in); + System.out.println("Enter a size of array: "); + int n = scanner.nextInt(); + String [] array = new String [n]; + for (int i = 0; i < array.length; i++) { + array[i] = String.valueOf((Math.random() * 100) - 50); + } + System.out.println(Arrays.toString(array)); + System.out.println("Преобразую всё в строку "); + String stringArray = String.join(",", array); + System.out.println(" Преобразую в массив символов "); + System.out.println(stringArray.toCharArray()); + System.out.println("Выполню поиск макисимальную сумму элемента массива "); + System.out.println(getMaxSum(stringArray.toCharArray())); + + } + public static int getMaxSum(char [] array) { + int maxSum = array[0] + array[array.length - 1]; + for (int i = 1; i < array.length / 2; i++) { + if ((array[i] + array[array.length - i - 1]) > maxSum) { + maxSum = array[i] + array[array.length - i - 1]; + } + + } + return maxSum; + } + +} diff --git a/Task7/target/classes/Task_7.class b/Task7/target/classes/Task_7.class new file mode 100644 index 0000000000000000000000000000000000000000..65b0b366139e1d78606019300dcc9eff87f2b152 GIT binary patch literal 1824 zcmZ`(TT@$A6#jN{;DjUy1;VAE9<{bf3XN7QEw@sEYLrWB5Jl8-2#0VWoM1TVP@gRH z&C86wJI-{R@x=$q43OdGyH6)?{s4bPXS9C%9A*d=VUo4i?c3j4d#(KO&)yM$PGo~< z#dQ@os?d#|AbjYRr@jFCgSd$SX}P81ogfA=R5>ukB>q(nB)vlrRTvK9Hr@^3y#SI@ ze?Nc^q#Tg|qXCQsaUSDRxufE)iVp=Udrix<`vv^b*rb3mn42>MYDP@U7%ME#8uv`3y7b&j=GxSJS#>8F~6Wl!9$$6DiNgO9XGI(DQlyfk0^01;6EKb^pCp zpgLvi>7`M9#bvD`${q_;Wej^%UrQC12^O6mjFFXZdXODiKDGu^xk5f|+%{$XA+N+M zvZ^rJ@S?yux59F6DpFxg;3F9@8OF!>M4)NdvW>i^Ypdp0hL)SxT;koDim5O@#dH{- z;d6o7=i8;?i!knCCJY_3D$-%hfjruspG#jm+s={mgmTl_Ep3#(*PN}=!_p5F8s$12 zN6ubpLu0Gj!TarGT*X`RvL!x) z*YH!F8J}G=()KA+>cOgQ@Cki#>>}Rto4G{NS}E9^J40XQz%)nCbjX49=L!ToNxZ{R zJxQ#0Uxj#OX3pn|49dz2kAa^bbJa4|?4(6xt`!ICg_GAE)$IjVm)EVi9C_0}M8x}g zwqT6UOT?krSwrm2hdXTUtjo2tbKYhNTspOHUYmN(#8DP=vQxw5#0MAje9HK;U|4CR zr+gz%InIO&**O_>ynaeFCO61kC;4L%O~xki3V(B2-QOrbgxnl{zeGJjDJU!AyAV%! z@Zn{CSGq<88qZ-bfDo@ztHNuzKns&aC*vw;+t`P1Y772dC?i{_sH@z8dU*$dzP3YD zjrp%B5vAkkFZgq9jmohhOw^+*xFKKqL~9YxeKOJ<*=tgEA;zFU!cgJ*A1 zb`aS?qck;@nTlxML5rmBcd7TIhUYqjP|yDcG$X=l8*vFuxIuXnEl9E(ciE3Ac0#8& z%W`aHud_&v+5Id`qy9QBLZQCF>?majYltDv@|&@Q%k=t~J&$&J{X~nS16P=lU~Ch7 z&j?bX;tdsV3JL){nXZ#dw=Ew#`X% z>o2G+*LxrN*t$Pke`B^+_<52BUnj)(iIBP^f0gI!q@~fLF|L}VrQJupo3uMAL!|pQ YZNjA;g8y$+3vuBopH|=+1AOTE7l$R@J^%m! literal 0 HcmV?d00001 From f4c23219187210615e57a92df1890da7e916e6ea Mon Sep 17 00:00:00 2001 From: Eugene Date: Wed, 7 Aug 2019 23:22:39 +0300 Subject: [PATCH 11/70] second commit Task_7 --- .idea/misc.xml | 2 ++ Task7/Task7.iml | 15 +++++++++++++++ Task7/src/main/java/Task_1_1.java | 11 +++++++++++ 3 files changed, 28 insertions(+) create mode 100644 Task7/Task7.iml create mode 100644 Task7/src/main/java/Task_1_1.java diff --git a/.idea/misc.xml b/.idea/misc.xml index a24dae4..f05e80b 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -10,7 +10,9 @@ + \ No newline at end of file diff --git a/Task7/Task7.iml b/Task7/Task7.iml new file mode 100644 index 0000000..850d40f --- /dev/null +++ b/Task7/Task7.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task7/src/main/java/Task_1_1.java b/Task7/src/main/java/Task_1_1.java new file mode 100644 index 0000000..5748e8f --- /dev/null +++ b/Task7/src/main/java/Task_1_1.java @@ -0,0 +1,11 @@ +public class Task_1_1 { + public static void main(String[] args) { + // В массиве целых чисел с количеством элементов n найти наиболее часто встречающееся число. Если таких + // чисел несколько, то определить наименьшее из них. + + try() + + + + } +} From 86215f8bc5f1c591c7abf34ea38d72cb04efb3a0 Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 8 Aug 2019 00:09:54 +0300 Subject: [PATCH 12/70] forth commit Task_7 --- .idea/compiler.xml | 2 ++ .idea/modules.xml | 1 + Task7/Task7.iml | 2 +- Task7/pom.xml | 24 ++++++++++++++++++ Task7/src/main/java/Task_1_1.java | 11 -------- Task7/src/main/java/Task_7.java | 42 +++++++++++++++++++++++++++++++ 6 files changed, 70 insertions(+), 12 deletions(-) create mode 100644 Task7/pom.xml delete mode 100644 Task7/src/main/java/Task_1_1.java create mode 100644 Task7/src/main/java/Task_7.java diff --git a/.idea/compiler.xml b/.idea/compiler.xml index d2573d8..e719dd0 100644 --- a/.idea/compiler.xml +++ b/.idea/compiler.xml @@ -6,6 +6,7 @@ + @@ -23,6 +24,7 @@ + \ No newline at end of file diff --git a/.idea/modules.xml b/.idea/modules.xml index 26c6637..948f8e8 100644 --- a/.idea/modules.xml +++ b/.idea/modules.xml @@ -10,6 +10,7 @@ + \ No newline at end of file diff --git a/Task7/Task7.iml b/Task7/Task7.iml index 850d40f..c035f0b 100644 --- a/Task7/Task7.iml +++ b/Task7/Task7.iml @@ -1,5 +1,5 @@ - + diff --git a/Task7/pom.xml b/Task7/pom.xml new file mode 100644 index 0000000..8361fb0 --- /dev/null +++ b/Task7/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + Algorithmization + Task#7 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 8 + 8 + + + + + + + \ No newline at end of file diff --git a/Task7/src/main/java/Task_1_1.java b/Task7/src/main/java/Task_1_1.java deleted file mode 100644 index 5748e8f..0000000 --- a/Task7/src/main/java/Task_1_1.java +++ /dev/null @@ -1,11 +0,0 @@ -public class Task_1_1 { - public static void main(String[] args) { - // В массиве целых чисел с количеством элементов n найти наиболее часто встречающееся число. Если таких - // чисел несколько, то определить наименьшее из них. - - try() - - - - } -} diff --git a/Task7/src/main/java/Task_7.java b/Task7/src/main/java/Task_7.java new file mode 100644 index 0000000..1d1c575 --- /dev/null +++ b/Task7/src/main/java/Task_7.java @@ -0,0 +1,42 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +public class Task_7 { + public static void main(String[] args) { + + //7. Даны действительные числа a 1 , a 2 ,  , a n . Найти + //max( a 1 + a 2 n , a 2 + a 2 n − 1 ,  , a n + a n + 1 ) . + int [] mas; + int n, i, j; + int max; + + try(BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { + + System.out.println("Enter the size of array n: "); + n = Integer.parseInt(reader.readLine()); + + //инициализация и заполнение массива рандомными значениями от -1000 до 1000 + mas = new int[2 * n]; + for (i = 0; i < mas.length; i++) { + int sing = Math.random() < 0.5 ? -1 : 1; + mas[i] = (int) (Math.random() * 1000) * sing; + + } + + i = 0; + j = mas.length - 1; + max = Integer.MIN_VALUE; + for (; i < j; i++, j--) { + max = Integer.max(mas[i] + mas[j], max); + } + + System.out.println("\n" + max); + } catch (IOException e) { + e.printStackTrace(); + } + + + } + +} From bc0600d61c2514dcee8087931bb7afaab17d8b61 Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 8 Aug 2019 00:15:36 +0300 Subject: [PATCH 13/70] fifth commit Task_7 --- Task7/src/main/java/Task_7.java | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/Task7/src/main/java/Task_7.java b/Task7/src/main/java/Task_7.java index 1d1c575..64b71e8 100644 --- a/Task7/src/main/java/Task_7.java +++ b/Task7/src/main/java/Task_7.java @@ -17,11 +17,11 @@ public static void main(String[] args) { n = Integer.parseInt(reader.readLine()); //инициализация и заполнение массива рандомными значениями от -1000 до 1000 - mas = new int[2 * n]; + mas = new int[n]; for (i = 0; i < mas.length; i++) { int sing = Math.random() < 0.5 ? -1 : 1; mas[i] = (int) (Math.random() * 1000) * sing; - + System.out.print(mas[i]+", "); } i = 0; @@ -31,7 +31,7 @@ public static void main(String[] args) { max = Integer.max(mas[i] + mas[j], max); } - System.out.println("\n" + max); + System.out.println("\nmax value is " + max); } catch (IOException e) { e.printStackTrace(); } From bfc39acb44ff3a251b1d0b403714c66eeda90fa4 Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 8 Aug 2019 20:27:25 +0300 Subject: [PATCH 14/70] second commit for all --- .idea/workspace.xml | 3 --- 1 file changed, 3 deletions(-) diff --git a/.idea/workspace.xml b/.idea/workspace.xml index 3ae93eb..16e7600 100644 --- a/.idea/workspace.xml +++ b/.idea/workspace.xml @@ -39,9 +39,6 @@ - - - \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml index f05e80b..db7631b 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -11,6 +11,7 @@ diff --git a/.idea/modules.xml b/.idea/modules.xml index 948f8e8..68a86fd 100644 --- a/.idea/modules.xml +++ b/.idea/modules.xml @@ -11,6 +11,7 @@ + \ No newline at end of file diff --git a/Task8/Task8.iml b/Task8/Task8.iml new file mode 100644 index 0000000..d04ccda --- /dev/null +++ b/Task8/Task8.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task8/pom.xml b/Task8/pom.xml new file mode 100644 index 0000000..5975322 --- /dev/null +++ b/Task8/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + Algorithmization + Task#8 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task8/src/main/java/Task_8.java b/Task8/src/main/java/Task_8.java new file mode 100644 index 0000000..5bc04f0 --- /dev/null +++ b/Task8/src/main/java/Task_8.java @@ -0,0 +1,54 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + Rus 8. Дана последовательность целых чисел a 1 , a 2 ,  , a n . Образовать новую последовательность, выбросив из + исходной те члены, которые равны min( a 1 , a 2 ,  , a n ) . + Eng 8.Given a sequence of integers a 1, a 2, , a n. Form a new sequence by throwing out +         the initial terms are those that are min (a 1, a 2, , a n). +*/ +public class Task_8 { + public static void main(String[] args) { + try (BufferedReader rd = new BufferedReader(new InputStreamReader(System.in))) { + int[] firstArray; + int min, n, count; + int[] secondArray; + System.out.println("Enter the size for array :"); + n = Integer.parseInt(rd.readLine()); + //filling array of random values + firstArray = new int[n]; + for (int i = 0; i < firstArray.length; i++) { + int sing = Math.random() < 0.5 ? -1 : 1; + firstArray[i] = (int) (Math.random() * 100) * sing; + System.out.print(firstArray[i] + ","); + } + //lets find min value and determinate of amount + min = Integer.MAX_VALUE; + count = 0; + for (int element : firstArray) { + if (element < min) { + min = element; + count = 1; + } else if (element == min) { + count++; + } + } + //initialization and filling new array + secondArray = new int[firstArray.length - count]; + for (int i = 0, j = 0; i < firstArray.length; i++, j++) { + if (firstArray[i] != min) { + secondArray[j] = firstArray[i]; + } else { + j--; + } + } + System.out.printf("%n%n The value last array: %d%n", min); + //Output new array + System.out.println("\n New array:"); + for (int element : secondArray) + System.out.printf("%3d ", element); + } catch (IOException e) { + e.printStackTrace(); + } + } +} \ No newline at end of file From 4815b525bb51e2698cda007d63c22ccde3bb592e Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 8 Aug 2019 21:20:30 +0300 Subject: [PATCH 17/70] first commit for Task_9 --- .idea/compiler.xml | 2 ++ .idea/misc.xml | 1 + .idea/modules.xml | 1 + Task9/Task9.iml | 15 +++++++++ Task9/pom.xml | 24 ++++++++++++++ Task9/src/main/java/Task_9.java | 59 +++++++++++++++++++++++++++++++++ 6 files changed, 102 insertions(+) create mode 100644 Task9/Task9.iml create mode 100644 Task9/pom.xml create mode 100644 Task9/src/main/java/Task_9.java diff --git a/.idea/compiler.xml b/.idea/compiler.xml index 7fc6c0f..8a97412 100644 --- a/.idea/compiler.xml +++ b/.idea/compiler.xml @@ -6,6 +6,7 @@ + @@ -27,6 +28,7 @@ + \ No newline at end of file diff --git a/.idea/misc.xml b/.idea/misc.xml index db7631b..bab86ef 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -12,6 +12,7 @@ diff --git a/.idea/modules.xml b/.idea/modules.xml index 68a86fd..1b92da5 100644 --- a/.idea/modules.xml +++ b/.idea/modules.xml @@ -12,6 +12,7 @@ + \ No newline at end of file diff --git a/Task9/Task9.iml b/Task9/Task9.iml new file mode 100644 index 0000000..d04ccda --- /dev/null +++ b/Task9/Task9.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task9/pom.xml b/Task9/pom.xml new file mode 100644 index 0000000..6eee5df --- /dev/null +++ b/Task9/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + Algorithmization + Task#9 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task9/src/main/java/Task_9.java b/Task9/src/main/java/Task_9.java new file mode 100644 index 0000000..72349a1 --- /dev/null +++ b/Task9/src/main/java/Task_9.java @@ -0,0 +1,59 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +public class Task_9 { + public static void main(String[] args) { + /* + * Rus 9. В массиве целых чисел с количеством элементов n найти наиболее часто встречающееся + * число. Если таких чисел несколько, то определить наименьшее из них. + * + * Eng 9. In the array of integers with the number of elements n find the most common +         * number. If there are several such numbers, then determine the smallest of them. + */ + System.out.println("Enter the size of array: "); + try (BufferedReader rd = new BufferedReader(new InputStreamReader(System.in))) { + int n = Integer.parseInt(rd.readLine()); + int[] array = new int[n]; + for (int i = 0; i < array.length; i++) { + int rand = Math.random() < 0.5 ? -1 : 1; + array[i] = (int) (Math.random() * 100) * rand; + System.out.printf("%d ", array[i]); + } + System.out.println("\nMake sort for the check"); + for (int i = array.length - 1; i > 0; i--) { + for (int j = 0; j < i; j++) { + if (array[j] < array[j + 1]) { + int a = array[j]; + array[j] = array[j + 1]; + array[j + 1] = a; + } + } + System.out.printf("%d ", array[i]); + } + int i, j, commonNumber, howManyTimes, counter; + commonNumber = array[1]; + howManyTimes = 1; + counter = 0; + int count = 0; + for (i = 1; i < n; i++) { + for (j = 1; j < n; j++) { + if (array[i] == array[j]) + counter++; + count++; + } + if (((howManyTimes == counter) && (commonNumber > array[i])) || (howManyTimes < counter)) { /*выбираем меньшее из "одинаковых*/ + commonNumber = array[i]; + howManyTimes = counter; + } + counter = 0; // сбрасываем счётчик + count = 0; + } + System.out.print("\n The most common smallest number = " + commonNumber + + " How many times meets = " + howManyTimes); + } catch (IOException e) { + e.printStackTrace(); + } + } +} + From 0c4ab20aeb3da1e288fd8ca52570f32bcafa3644 Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 8 Aug 2019 21:31:29 +0300 Subject: [PATCH 18/70] first commit for Task_10 --- .idea/compiler.xml | 2 ++ .idea/misc.xml | 1 + .idea/modules.xml | 1 + Task10/Task10.iml | 15 ++++++++++ Task10/pom.xml | 24 +++++++++++++++ Task10/src/main/java/Task_10.java | 49 +++++++++++++++++++++++++++++++ 6 files changed, 92 insertions(+) create mode 100644 Task10/Task10.iml create mode 100644 Task10/pom.xml create mode 100644 Task10/src/main/java/Task_10.java diff --git a/.idea/compiler.xml b/.idea/compiler.xml index 8a97412..17d7e33 100644 --- a/.idea/compiler.xml +++ b/.idea/compiler.xml @@ -6,6 +6,7 @@ + @@ -21,6 +22,7 @@ + diff --git a/.idea/misc.xml b/.idea/misc.xml index bab86ef..ab31e1f 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -13,6 +13,7 @@ diff --git a/.idea/modules.xml b/.idea/modules.xml index 1b92da5..a7b69c2 100644 --- a/.idea/modules.xml +++ b/.idea/modules.xml @@ -5,6 +5,7 @@ + diff --git a/Task10/Task10.iml b/Task10/Task10.iml new file mode 100644 index 0000000..d04ccda --- /dev/null +++ b/Task10/Task10.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task10/pom.xml b/Task10/pom.xml new file mode 100644 index 0000000..4661f1e --- /dev/null +++ b/Task10/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + Algorithmization + Task#10 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task10/src/main/java/Task_10.java b/Task10/src/main/java/Task_10.java new file mode 100644 index 0000000..edcf662 --- /dev/null +++ b/Task10/src/main/java/Task_10.java @@ -0,0 +1,49 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +public class Task_10 { + public static void main(String[] args) { + +/* RUS 10. Дан целочисленный массив с количеством элементов п. + Сжать массив, выбросив из него каждый второй элемент (освободившиеся элементы заполнить нулями) + Примечание. Дополнительный массив не использовать. + + ENG 10.Given an integer array with the number of elements n. +     Compress the array, throwing out every second element from it (fill in the empty elements with zeros) +     Note. Do not use an additional array. +*/ + try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))){ + System.out.println("Enter the size of array"); + int n = Integer.parseInt(reader.readLine()); + int[] array = new int[n]; + for (int i = 0; i < array.length; i++) { + int negativePositive = Math.random() < 0.5 ? -1 : 1;//determinate negative or positive values + array[i] = (int) (Math.random() * 100) * negativePositive; //filling + System.out.print(array[i] + ","); + } + System.out.println(); + zerosChanging(array); + System.out.println(); + arrayCompressing(array); + } catch (IOException e) { + e.printStackTrace(); + } + } + private static void arrayCompressing(int[] array) { + int counter = 1; + for (int i = 0; i < array.length; i += 2) { + array[counter - 1] = array[i]; + counter++; + System.out.print(array[i] + ","); + } + } + private static void zerosChanging(int[] array) { + for (int i = 0; i < array.length; i++) { + if (i % 2 != 0) + array[i] = 0; + System.out.print(array[i] + ","); + } + } +} + \ No newline at end of file From 4b2699c40f14e583aeda226d550bab988e9b2a37 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Thu, 8 Aug 2019 21:53:02 +0300 Subject: [PATCH 19/70] Delete modules.xml --- .idea/modules.xml | 32 -------------------------------- 1 file changed, 32 deletions(-) delete mode 100644 .idea/modules.xml diff --git a/.idea/modules.xml b/.idea/modules.xml deleted file mode 100644 index e83db97..0000000 --- a/.idea/modules.xml +++ /dev/null @@ -1,32 +0,0 @@ - - - - - - - - - - - - - -<<<<<<< HEAD -<<<<<<< HEAD - -<<<<<<< HEAD -======= ->>>>>>> Task_7 -======= - ->>>>>>> Task_7 -======= - -<<<<<<< HEAD ->>>>>>> Task_8 -======= - ->>>>>>> Task_9 - - - \ No newline at end of file From 7be08dbfbfecb908664bfdff61d085ae4092628e Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Thu, 8 Aug 2019 21:53:58 +0300 Subject: [PATCH 20/70] Delete .gitignore --- .idea/.gitignore | 2 -- 1 file changed, 2 deletions(-) delete mode 100644 .idea/.gitignore diff --git a/.idea/.gitignore b/.idea/.gitignore deleted file mode 100644 index 5c98b42..0000000 --- a/.idea/.gitignore +++ /dev/null @@ -1,2 +0,0 @@ -# Default ignored files -/workspace.xml \ No newline at end of file From 8e2cc0cd1f6d3fd43a84512f4d8251ab53fc6553 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Thu, 8 Aug 2019 21:54:17 +0300 Subject: [PATCH 21/70] Delete 2_Algorithmization.iml --- .idea/2_Algorithmization.iml | 9 --------- 1 file changed, 9 deletions(-) delete mode 100644 .idea/2_Algorithmization.iml diff --git a/.idea/2_Algorithmization.iml b/.idea/2_Algorithmization.iml deleted file mode 100644 index d6ebd48..0000000 --- a/.idea/2_Algorithmization.iml +++ /dev/null @@ -1,9 +0,0 @@ - - - - - - - - - \ No newline at end of file From 377d8218ab6940a4257fae510ecdda8be0c9ef72 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Thu, 8 Aug 2019 21:54:25 +0300 Subject: [PATCH 22/70] Delete compiler.xml --- .idea/compiler.xml | 65 ---------------------------------------------- 1 file changed, 65 deletions(-) delete mode 100644 .idea/compiler.xml diff --git a/.idea/compiler.xml b/.idea/compiler.xml deleted file mode 100644 index c1bb2ee..0000000 --- a/.idea/compiler.xml +++ /dev/null @@ -1,65 +0,0 @@ - - - - - - - - -<<<<<<< HEAD -<<<<<<< HEAD -<<<<<<< HEAD -<<<<<<< HEAD -<<<<<<< HEAD -======= -======= -======= - ->>>>>>> Task_10 - ->>>>>>> Task_9 - ->>>>>>> Task_8 - -======= ->>>>>>> Task_7 -======= - ->>>>>>> Task_7 - - - - - - - - - - - - - - - - - - -<<<<<<< HEAD -<<<<<<< HEAD - -======= ->>>>>>> Task_7 -======= - -<<<<<<< HEAD ->>>>>>> Task_7 -======= - -<<<<<<< HEAD ->>>>>>> Task_8 -======= - ->>>>>>> Task_9 - - - \ No newline at end of file From 1f9608c6dd8b428694d88823460ebc48840d2442 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Thu, 8 Aug 2019 21:54:35 +0300 Subject: [PATCH 23/70] Delete misc.xml --- .idea/misc.xml | 24 ------------------------ 1 file changed, 24 deletions(-) delete mode 100644 .idea/misc.xml diff --git a/.idea/misc.xml b/.idea/misc.xml deleted file mode 100644 index 92de72f..0000000 --- a/.idea/misc.xml +++ /dev/null @@ -1,24 +0,0 @@ - - - - - -<<<<<<< HEAD -======= - ->>>>>>> Task_7 - \ No newline at end of file From cdd3b12de35877fe053bf50d52752b51c3a1b5d4 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Thu, 8 Aug 2019 21:54:42 +0300 Subject: [PATCH 24/70] Delete vcs.xml --- .idea/vcs.xml | 6 ------ 1 file changed, 6 deletions(-) delete mode 100644 .idea/vcs.xml diff --git a/.idea/vcs.xml b/.idea/vcs.xml deleted file mode 100644 index 35eb1dd..0000000 --- a/.idea/vcs.xml +++ /dev/null @@ -1,6 +0,0 @@ - - - - - - \ No newline at end of file From d44cd11e93105c6a42bfaf49a6c359ce7de61b75 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Thu, 8 Aug 2019 21:55:05 +0300 Subject: [PATCH 25/70] Delete workspace.xml --- .idea/workspace.xml | 157 -------------------------------------------- 1 file changed, 157 deletions(-) delete mode 100644 .idea/workspace.xml diff --git a/.idea/workspace.xml b/.idea/workspace.xml deleted file mode 100644 index 7537594..0000000 --- a/.idea/workspace.xml +++ /dev/null @@ -1,157 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 1564602937435 - - - 1564607705938 - - - - - - - - - \ No newline at end of file From ed91282048f73d8e5f0d4263e5d6b48b1472a98c Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Thu, 8 Aug 2019 21:55:20 +0300 Subject: [PATCH 26/70] Delete .gitignore --- .gitignore | 3 --- 1 file changed, 3 deletions(-) delete mode 100644 .gitignore diff --git a/.gitignore b/.gitignore deleted file mode 100644 index 02b99ba..0000000 --- a/.gitignore +++ /dev/null @@ -1,3 +0,0 @@ -.idea/ -target/ -*.iml/ From 260d9dbf261aeaff0f9a935fe4246b82393f79c7 Mon Sep 17 00:00:00 2001 From: Eugene Date: Thu, 8 Aug 2019 22:27:35 +0300 Subject: [PATCH 27/70] fix gitignore --- .gitignore | 3 ++ Task1/target/classes/Task_1.class | Bin 1446 -> 0 bytes Task11/src/main/java/Task_11.java | 31 +++++++++++ Task2/target/classes/Task_2.class | Bin 1404 -> 0 bytes Task3/target/classes/Task_3.class | Bin 1538 -> 0 bytes Task4/target/classes/Task_4.class | Bin 1455 -> 0 bytes Task5/target/classes/Task_5.class | Bin 1288 -> 0 bytes Task6/target/classes/Task_6.class | Bin 1482 -> 0 bytes Task7/Task7.iml | 27 ---------- Task7/pom.xml | 27 ---------- Task7/src/main/java/Task_7.java | 85 ------------------------------ Task7/target/classes/Task_7.class | Bin 1824 -> 0 bytes 12 files changed, 34 insertions(+), 139 deletions(-) create mode 100644 .gitignore delete mode 100644 Task1/target/classes/Task_1.class create mode 100644 Task11/src/main/java/Task_11.java delete mode 100644 Task2/target/classes/Task_2.class delete mode 100644 Task3/target/classes/Task_3.class delete mode 100644 Task4/target/classes/Task_4.class delete mode 100644 Task5/target/classes/Task_5.class delete mode 100644 Task6/target/classes/Task_6.class delete mode 100644 Task7/Task7.iml delete mode 100644 Task7/pom.xml delete mode 100644 Task7/src/main/java/Task_7.java delete mode 100644 Task7/target/classes/Task_7.class diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..00c529e --- /dev/null +++ b/.gitignore @@ -0,0 +1,3 @@ +.idea/ +target/ +*.iml/ \ No newline at end of file diff --git a/Task1/target/classes/Task_1.class b/Task1/target/classes/Task_1.class deleted file mode 100644 index ce0cdb2eb33efac57b149ce31e652cac2615a9fa..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 1446 zcmZuxO>-MX5Pc(QKeXP&w(Ru>7_yK6vV$y}4*_-(k~lF46g!Dbz!(T)d$BfNtyHU3 zig3s&#f2glZWIS97fv}O2iZj^{{VgkXMP0mX62MZqOIDQo}TX4-LHH1&wqYD05Fg1 z7A7!fU_OgC@TP?n-cr)rCQ26G!MjTHo{0qui#Vm9U8fTt1E(zp0|Orl=%@V9kIx9C^V8P^GE0qZPhha(hu%uNzUf74ax z8MFzTkgNltySYa6#!`O>l>9+juJh$`h zuxjHnuGqMWs=#>HDwJ_Ml7Sm0w7I*kfi)YSfK`t_&Bgh)A8dP(flqCGhIJdCV}t2i z>hy(;FL6a+X07JAEJnrk0o*QkxbWbxol~-T!Eop z*wxJ&-d6lSRrOXY_DEGqHO%P}>^F+#u-T5;F;CV>@kGAwg=%HG(I#Ne@iLp-a~w%x z6YmK%JK9u6feLsC{Pchrq4#ZE4vEZxWJ{0sYPclh8mo(BxZPmhyua|cprn!K)Fh~J zj2qpFOXjdV{p=(XMK+sWxGhlVm&Y?6hy5ZUqxrsgT2h$6RK8EV$KH4eJMv0DYA!(QYKx}(k0!|3kUb$6dZjY)+h#c@2=j_#c%)qP2)#6vc89- zg?$WmFq9kS(m}3+k-~yLsUMV#bjfr~$GC@Mle%NhmaymcIB+_3! zq}(VWoJ} zs#cYd`qWDNKpzlN+sE?YAcFD%d1V_YU&AIHe*1oKLJa68=+5~V6Kk3+q zQ4P5^9K|sm5gb>mZ<6>{#|exn%gH28>G%$(6XzF5;-g_)#~zI8ID@llbuNkT)qGx& zCX%?IHj^4IYM2s8oUt9-KPM2)49yF~Cf#LAptE2*)=a&+WO;LPsX|Mt;Fe@%UV66L zZy95L*{%sB3v;se;O_Bp@~hHz1ombY3-{$inX5==C0F!4+gTY`{)NpqPn`5t$n0qW z6VPfU={T0h^UzD(w=20~Xk-w<2yy9o^07c11_4JEhk_yT&-t$QWwlC83C4-*?z zxftj}zd(18*G`WbE*ba%KPo`pz-3%v0aK1|d8RaL_L^n7_sk&NX$=Jf)0im_r zLX;!@x+g2969{ImnHsJcxQ-$bpQ>=7ZdaBqPs5yn8<;n66Sr7^u67FsZevDZK%XmH zrmU)hRP0ijDpEnyu9=Fk$hL)r33N3B%r4!xN>pHnsrb0&TUDy0nvxF1wB20ZS*`o* ziY2R*voF)~K(#CC*6FZGyvjy4i9JDV`rBb<_f{3Cq5^I?{`3-Pj`hgTt7h@iv3(uQ z8m6URW_6x)mR;t}^NZUB1udIUT~}Amcf(s1+_n7B?%PH$a&^^mmIbn{^4P`L>I?&q+rJx#EWAK;9kId-#8Zg|w2=mqX9r*FGs@7mWf+S^$KuhkL^_e( ze1>#3op=eo7wr%JoPClIfB*lE;0^3qSVu?pB|01EN_BH+Ak{$6N8SK=qv_al7+j=d zvrpn8V87kX?j<`NZy+7IXcl-GDJHI?oxdKI*vGHWAUbdmoft+JvgpQ1VkSA~(F=?E zxm55Gk-t#A-?;ysjDIML66rdU{0R0_=K~a_Op(GB#lctf3dZ>hhj5tE_2DUw5Emiy c4`eWeC}aN0_W)vy{4++liWB)Yc@bnk0J-ltBme*a diff --git a/Task3/target/classes/Task_3.class b/Task3/target/classes/Task_3.class deleted file mode 100644 index 1018e46ac0f02e95be81a0ab1891b9232550b2bd..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 1538 zcmZux+jA3D9R5zS$!@k=+9pk@QYGFn1=Dbms1%TL(`aamsbE_WPm{H5Np|CAgTgpE z<8;O+{R`eBY-{t#$*UfML{P+OC0bDUL ziTyebq;L?2OvLc2x*ax9GVvN-SDH6W9Kmez#4-_lbR0EdVZVuEIIeDQ8aScOIfXcB z;FJbOpDTp*sGz968T^6Iw0NX2pO`A&1q_Lt;ZgPL^3tI5U% z={rj9DYf9L(-tr)OR|0K%Ar}}o6>OwCi1J54S8J_8`51bRs-L0*Jl;KaQG|JPx|Xb zW(K$k=bDJ!NMZWTX+vu9ZMG82dm!scrQ+NoJQUDbzHRY0hTSSV3l>5O1fm> zGR_O^nro`66uH~0Ea!$JY3CH+!$(|Ny<-1&;Sl=-H(7d)!;Z=o80{ytu(n~>f=5)< z8|}buvbSoK*=PigS1h}&PQY2(vdJM#<_8+okmFv5gni&5$KMBL!r0{7rsm9B%Bi6O z_J|)}9o@A*3(78;xvCucj(!d2WN?+$`O>X>%$xSp4+{zhIj43-Eo$IJyBKb0dHTs6 zC5vpeY_~2@7?j5oh~6aGkn#LLzC>7nAg4?Jy>7Z)Wq$7|EB+aSj$@&F5JV8E=JO$e04F_MViof zDG@Iv<0U<-D~>&dtUmJ{QVNTV627O9ppe{5icOu2fAksC8B%4nF2+MXeVZk#EQvvu z31wjgJxsqRE0|!d28P&!4AkG}5T@9jJs8Gep0gOiMU3*x8RG|*#z*wpz&JiZ7M~LP z1xK*S)_+a?H$>iMcYk45|72fPpD&SjH}%is1!$;YZ+O#HfAJz-;yHxh8SQ0ue-ghU mPrn%bf5tR@mUR1N}joM=bm%#J$L-azxN*j_y7wQ zwjn3+ejg9}EyVDlwhkn5&_W&`Y0n`GhjAovVwMPg5|b8eM`B;$yv^(1?>s zoYIHWNt}^5D{)RBan$p@@VG!cGd3e&oUT_~fq|muyHl;&q8m)B#VS3iVtq+fXH?+n z^SaXruX;^^WN}(GuYYx5lK7hPe1WZ*`QkNoL*=TvOef*DK|1nQ8AIco34M8j6<7IYGjwazK=snRwyEuiTk4B^f~#gJad8r*E_P!rU2WzlCD?aAwHSg$G5e{Ljd!sL2f0sT0GE-% z9B&sejAb|oh`GT5e9!0~==+)a{e~U*oyf=7i6_+dZz`+xz7lCX%8~7cfv+(hSyJna zx3PzNKmNiy%%=zW40{a1TQH22fdCGu z-ADun4IIK@Wf?V)#*y%;c}DQlanyi`Ap^%Srgq~I99QcJ6)~Z9CnGqe-ZA_!NkCvfOfW+w*@w59oL?&tSs8ztXwS663rHuWMNKvjykU!HUExN7KmhLW%=H% z(Q(GFNXHfEPAp{a%KI`^knVCS=X;L3Jg)GC!;ujP-Is+5VKwP36QQ$-yMSI^lCEoe zysx8Ge5a7g)s0Lhm?{s1TkAy)t2#{dASTdJtLaY^9cN9P z!=!SUGI1UkSp1~x+g@D8%g$pvUc4Qzr5MwZF>w)>Ok{Cc$FzwVToLH`m*<&^Q^?z% zj;kiFA!lM1*IBEfPID%1D1=$uq-luq*NYTrZ@|nf-nEzfzf8GDW#3*QOC_#V7sDy0 zGH$8jQ(arGP>xul>4lO#Sga7R5qO0U(g^IVE?^9oA>872-W02tzJ#Fj$f>IN3CZv1OImoQDmuPyLo|RvpW8Z zSl6F|bS0YNg=)kE`Vvj@ZA7CV7XLl<1;AHEjB_tfDXxNRX#Xn2``Yyu&f%I-!&dIi zx&!*Kji(lD#|~N;EOyf`Lfh-l2+V&#a1~ni147Yo75ZQmkrRDijOk!nv$W*e8^n^9 z_7N>zFz&r*KbW6+riphyztjIS%=uMpN`6FJ6`P~&oT})kBAOi2dbPE5D3}ggVJq|o zBfXjx9!~3)o?Ls2ZH-t?ONVuH$H9 zE4QPB4m>~t<8 diff --git a/Task6/target/classes/Task_6.class b/Task6/target/classes/Task_6.class deleted file mode 100644 index d541903657e6c9eb2c0328e07169d625704108c9..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 1482 zcmZuwO>^5+6g|(DB}Gw_){YWW3{|0k)8d-&;WkZE`jHk4Zd&3H2my*>i$tj{d1M)A zS1d9EZ1@2z%c3iWX{U8ElQO6~DzNO=B4P_1Q2&kt$-;2%&B=eI?0?LJ;?h1@nJl~z~G*{hl(OGR!ldc3c zr?KROp1kiUm1x~-3+RDl$MXfo^DC7N=L@IUaQwAmH3~g{ZARh?k8hdp z27R4yjnSC_t^!)S=J>uF(%wVrL|&swR$DH+wE6V}{I zo~(PgSK4t|jfsPJTHruj*={@y@0zIKvUHd?aRpb|!bLxFL))?2-c8pIKDXm!r!>50 zVgXeXi+Eqdl8F!Sp}@qG-Jb7wjk+6ZST^wyR!n@1PgtHIZ=agDhN{3w+iSKOuI!zKztgnT(>CbZB)ExbCY{FjVMm5<@$Aj!k{|# zMC?q9gpB0};-%uo1akTEUVA?}mmg5hzh)dpmVdT<5)g71`OWcGODQR9fvqJJy9hoBLIpPnHx* zDLlM|g9S_3#?WXm2IKnodi|S)O-0=P`w=4^z+B$KzQQ&}x)@FG=ckJUU8F~*l~hT! z)ZCA#rb?QnS?Vo}S*oSAet>!#CpR@hJkBZwOP#7sD}AhVh9DLz8B1G~q`iyr7**R; z8T8XG-wAqTmH+I09_Eo@e>#TQcLoMY9A@VxUc^3};5my?EF;ao$AXJ-1em~=^tws; zYm)pOy?>_dKH2+&{7F6+h-2tslE(jXDb}fyQD%6F=P-Ul9+Tudi)|dG ZUxJADa11Xa$*d6yI8GG7LCVp-@(&2eOPl}z diff --git a/Task7/Task7.iml b/Task7/Task7.iml deleted file mode 100644 index bc44c69..0000000 --- a/Task7/Task7.iml +++ /dev/null @@ -1,27 +0,0 @@ - -<<<<<<< HEAD -<<<<<<< HEAD - -======= - ->>>>>>> Task_7 -======= - ->>>>>>> Task_7 - - - - - - - - - -<<<<<<< HEAD - -======= - ->>>>>>> Task_7 - - - \ No newline at end of file diff --git a/Task7/pom.xml b/Task7/pom.xml deleted file mode 100644 index e0bcd5a..0000000 --- a/Task7/pom.xml +++ /dev/null @@ -1,27 +0,0 @@ - - - 4.0.0 - - Algorithmization - Task#7 - 1.0-SNAPSHOT - - - - org.apache.maven.plugins - maven-compiler-plugin - - 8 - 8 - - - - - -<<<<<<< HEAD -======= - ->>>>>>> Task_7 - \ No newline at end of file diff --git a/Task7/src/main/java/Task_7.java b/Task7/src/main/java/Task_7.java deleted file mode 100644 index b762503..0000000 --- a/Task7/src/main/java/Task_7.java +++ /dev/null @@ -1,85 +0,0 @@ -<<<<<<< HEAD -import java.util.Arrays; -import java.util.Scanner; -======= -import java.io.BufferedReader; -import java.io.IOException; -import java.io.InputStreamReader; ->>>>>>> Task_7 - -public class Task_7 { - public static void main(String[] args) { - -<<<<<<< HEAD -<<<<<<< HEAD - // char[] charArray = { 'q', 'w', 'e', ';', 'r', 't', 'y' }; //массив символов - // String str = new String(charArray); //из массива символов формируется строка - // String[] stringArray = str.split(';', "gkl;jk"); //из строки формируется массив строк. Разделитель - символ ';' - // String str2 = String.join(";", stringArray); //массив строк объединяется в строку с добавлением разделителя ';' - // char[] charArray1 = str2.toCharArray(); //из строки формируется массив символов - - // 7. Даны действительные числа //a a an , , , 1 2 . Найти max( , , , ) - - Scanner scanner = new Scanner(System.in); - System.out.println("Enter a size of array: "); - int n = scanner.nextInt(); - String [] array = new String [n]; - for (int i = 0; i < array.length; i++) { - array[i] = String.valueOf((Math.random() * 100) - 50); - } - System.out.println(Arrays.toString(array)); - System.out.println("Преобразую всё в строку "); - String stringArray = String.join(",", array); - System.out.println(" Преобразую в массив символов "); - System.out.println(stringArray.toCharArray()); - System.out.println("Выполню поиск макисимальную сумму элемента массива "); - System.out.println(getMaxSum(stringArray.toCharArray())); - - } - public static int getMaxSum(char [] array) { - int maxSum = array[0] + array[array.length - 1]; - for (int i = 1; i < array.length / 2; i++) { - if ((array[i] + array[array.length - i - 1]) > maxSum) { - maxSum = array[i] + array[array.length - i - 1]; - } - - } - return maxSum; -======= - //7. Даны действительные числа a 1 , a 2 ,  , a n . Найти -======= - //7. Даны действительные числа a 1 , a 2 ,  , a n . Найти ->>>>>>> Task_8 - //max( a 1 + a 2 n , a 2 + a 2 n − 1 ,  , a n + a n + 1 ) . - int[] array; - int n, i, j; - int max; - - try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { - System.out.println("Enter the size of array n: "); - n = Integer.parseInt(reader.readLine()); - //инициализация и заполнение массива рандомными значениями от -1000 до 1000 - array = new int[n]; - for (i = 0; i < array.length; i++) { - int negPos = Math.random() < 0.5 ? -1 : 1; - array[i] = (int) (Math.random() * 1000) * negPos; - System.out.print(array[i] + ", "); - } - i = 0; - j = array.length - 1; - max = Integer.MIN_VALUE; - for (; i < j; i++, j--) { - max = Integer.max(array[i] + array[j], max); - } - System.out.println("\nmax value is " + max); - } catch (IOException e) { - e.printStackTrace(); - } -<<<<<<< HEAD - - ->>>>>>> Task_7 -======= ->>>>>>> Task_8 - } -} diff --git a/Task7/target/classes/Task_7.class b/Task7/target/classes/Task_7.class deleted file mode 100644 index 65b0b366139e1d78606019300dcc9eff87f2b152..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 1824 zcmZ`(TT@$A6#jN{;DjUy1;VAE9<{bf3XN7QEw@sEYLrWB5Jl8-2#0VWoM1TVP@gRH z&C86wJI-{R@x=$q43OdGyH6)?{s4bPXS9C%9A*d=VUo4i?c3j4d#(KO&)yM$PGo~< z#dQ@os?d#|AbjYRr@jFCgSd$SX}P81ogfA=R5>ukB>q(nB)vlrRTvK9Hr@^3y#SI@ ze?Nc^q#Tg|qXCQsaUSDRxufE)iVp=Udrix<`vv^b*rb3mn42>MYDP@U7%ME#8uv`3y7b&j=GxSJS#>8F~6Wl!9$$6DiNgO9XGI(DQlyfk0^01;6EKb^pCp zpgLvi>7`M9#bvD`${q_;Wej^%UrQC12^O6mjFFXZdXODiKDGu^xk5f|+%{$XA+N+M zvZ^rJ@S?yux59F6DpFxg;3F9@8OF!>M4)NdvW>i^Ypdp0hL)SxT;koDim5O@#dH{- z;d6o7=i8;?i!knCCJY_3D$-%hfjruspG#jm+s={mgmTl_Ep3#(*PN}=!_p5F8s$12 zN6ubpLu0Gj!TarGT*X`RvL!x) z*YH!F8J}G=()KA+>cOgQ@Cki#>>}Rto4G{NS}E9^J40XQz%)nCbjX49=L!ToNxZ{R zJxQ#0Uxj#OX3pn|49dz2kAa^bbJa4|?4(6xt`!ICg_GAE)$IjVm)EVi9C_0}M8x}g zwqT6UOT?krSwrm2hdXTUtjo2tbKYhNTspOHUYmN(#8DP=vQxw5#0MAje9HK;U|4CR zr+gz%InIO&**O_>ynaeFCO61kC;4L%O~xki3V(B2-QOrbgxnl{zeGJjDJU!AyAV%! z@Zn{CSGq<88qZ-bfDo@ztHNuzKns&aC*vw;+t`P1Y772dC?i{_sH@z8dU*$dzP3YD zjrp%B5vAkkFZgq9jmohhOw^+*xFKKqL~9YxeKOJ<*=tgEA;zFU!cgJ*A1 zb`aS?qck;@nTlxML5rmBcd7TIhUYqjP|yDcG$X=l8*vFuxIuXnEl9E(ciE3Ac0#8& z%W`aHud_&v+5Id`qy9QBLZQCF>?majYltDv@|&@Q%k=t~J&$&J{X~nS16P=lU~Ch7 z&j?bX;tdsV3JL){nXZ#dw=Ew#`X% z>o2G+*LxrN*t$Pke`B^+_<52BUnj)(iIBP^f0gI!q@~fLF|L}VrQJupo3uMAL!|pQ YZNjA;g8y$+3vuBopH|=+1AOTE7l$R@J^%m! From d3f39c4fe1f191cba6d3f4c7d317b8cf943ae3a9 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Fri, 9 Aug 2019 12:20:48 +0300 Subject: [PATCH 28/70] Update README.md --- README.md | 35 +++++++++++++++++++++++++++++++++-- 1 file changed, 33 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 1b41d3b..38425cf 100644 --- a/README.md +++ b/README.md @@ -1,7 +1,38 @@ # Algorithmization - Описание файлов: - - Practice (tasks).pdf - файл содержит список задач, которые нужно решить для завершения этапа. - Questions.pdf - файл содержит вопросы, на которые нужно уметь отвечать по завершению этапа. - Recommendations.pdf - файл содержит рекомендуемые материалы (видео и книги), к которым следует обратиться при возникновении трудностей при решении задач или ответах на вопросы. + + ```java + import java.util.Arrays; +import java.util.Scanner; + +public class Task_1 { + public static void main(String[] args) { +// 1.ENG:Natural numbers are entered in the array A [N]. Find the sum of those elements that are multiples of a given K. +//1. RUS: В массив A [N] занесены натуральные числа. Найти сумму тех элементов, которые кратны данному К. + + Scanner scanner = new Scanner(System.in); + System.out.println("Enter a size of array:"); + int n = scanner.nextInt(); + int[] array = new int[n]; + System.out.println("Enter natural number k "); + int k = scanner.nextInt(); + + int sum = 0; + for (int i = 0; i < array.length; i++) { + array[i] = (int) (Math.random() * 100); + } + System.out.print(Arrays.toString(array) + "\n"); + + for (int i = 0; i < array.length; i++) { + if (array[i] % k == 0) { + sum = sum + array[i]; + } + } + System.out.print("The sum of elements that are multiples of " + k + " is " + sum); + } +} + ``` + From b317146d64e806daceb77cd0a1b8c85a89925604 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Fri, 9 Aug 2019 12:24:00 +0300 Subject: [PATCH 29/70] Update README.md --- README.md | 13 ++++++++++--- 1 file changed, 10 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 38425cf..7fdd27a 100644 --- a/README.md +++ b/README.md @@ -4,15 +4,19 @@ - Questions.pdf - файл содержит вопросы, на которые нужно уметь отвечать по завершению этапа. - Recommendations.pdf - файл содержит рекомендуемые материалы (видео и книги), к которым следует обратиться при возникновении трудностей при решении задач или ответах на вопросы. + Решение задач + ```java import java.util.Arrays; import java.util.Scanner; +// 1.ENG:Natural numbers are entered in the array A [N]. + Find the sum of those elements that are multiples of a given K. +// 1. RUS: В массив A [N] занесены натуральные числа. Найти сумму тех элементов, которые кратны данному К. + public class Task_1 { public static void main(String[] args) { -// 1.ENG:Natural numbers are entered in the array A [N]. Find the sum of those elements that are multiples of a given K. -//1. RUS: В массив A [N] занесены натуральные числа. Найти сумму тех элементов, которые кратны данному К. - + Scanner scanner = new Scanner(System.in); System.out.println("Enter a size of array:"); int n = scanner.nextInt(); @@ -35,4 +39,7 @@ public class Task_1 { } } ``` + __________________________________________________________________________________________________________________________________ + ```java + ``` From d39550d8773ba929df05e9a30066313d3096a8db Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Fri, 9 Aug 2019 12:25:03 +0300 Subject: [PATCH 30/70] Update README.md --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 7fdd27a..b7feabb 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,4 @@ -# Algorithmization +# 2_Algorithmization Описание файлов: - Practice (tasks).pdf - файл содержит список задач, которые нужно решить для завершения этапа. - Questions.pdf - файл содержит вопросы, на которые нужно уметь отвечать по завершению этапа. @@ -10,9 +10,9 @@ import java.util.Arrays; import java.util.Scanner; -// 1.ENG:Natural numbers are entered in the array A [N]. + 1.ENG:Natural numbers are entered in the array A [N]. Find the sum of those elements that are multiples of a given K. -// 1. RUS: В массив A [N] занесены натуральные числа. Найти сумму тех элементов, которые кратны данному К. + 1. RUS: В массив A [N] занесены натуральные числа. Найти сумму тех элементов, которые кратны данному К. public class Task_1 { public static void main(String[] args) { From 19e42a21420403a717812b9b12d3199d6034382e Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Fri, 9 Aug 2019 15:56:09 +0300 Subject: [PATCH 31/70] Update README.md --- README.md | 42 +++++++++++++++++++++++++++++++++++++++++- 1 file changed, 41 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index b7feabb..9fbb497 100644 --- a/README.md +++ b/README.md @@ -41,5 +41,45 @@ public class Task_1 { ``` __________________________________________________________________________________________________________________________________ ```java - + import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +public class Task_11 { + public static void main(String[] args) { + /* ENG 1. A matrix is given. Display all the odd columns +         *          whose first element is larger than the last. + * RUS 1. Дана матрица. Вывести на экран все нечетные столбцы, + * у которых первый элемент больше последнего. + */ + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int n = Integer.parseInt(read.readLine()); + System.out.println("Enter quality of columns"); + int m = Integer.parseInt(read.readLine()); + int[][] matrix = new int[n][m]; + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + matrix[i][j] = (int) (Math.random() * 100) * positiveNegative; + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println(); + + //Output result of matrix + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + if(j%2==0 && matrix[0][j] > matrix[n-1][j]) + System.out.printf(" %3d", matrix[i][j]); + } + System.out.println(); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} + ``` From d68bc52371f85d4dc10fefd25ec5610f82c824a6 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Sat, 17 Aug 2019 09:34:21 +0300 Subject: [PATCH 32/70] first commit task_12 --- Task12/Task12.iml | 15 +++++++++++ Task12/pom.xml | 24 +++++++++++++++++ Task12/src/main/java/Task_12.java | 45 +++++++++++++++++++++++++++++++ Task13/Task13.iml | 15 +++++++++++ Task13/pom.xml | 12 +++++++++ Task13/src/main/java/Task_13.java | 10 +++++++ 6 files changed, 121 insertions(+) create mode 100644 Task12/Task12.iml create mode 100644 Task12/pom.xml create mode 100644 Task12/src/main/java/Task_12.java create mode 100644 Task13/Task13.iml create mode 100644 Task13/pom.xml create mode 100644 Task13/src/main/java/Task_13.java diff --git a/Task12/Task12.iml b/Task12/Task12.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task12/Task12.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task12/pom.xml b/Task12/pom.xml new file mode 100644 index 0000000..19c8ac3 --- /dev/null +++ b/Task12/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + 2_Algorithmization + Task#12 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task12/src/main/java/Task_12.java b/Task12/src/main/java/Task_12.java new file mode 100644 index 0000000..3aef814 --- /dev/null +++ b/Task12/src/main/java/Task_12.java @@ -0,0 +1,45 @@ +import java.io.*; + +public class Task_12 { + // ENG 2. Given a square matrix. Display the elements that are on the diagonal. + // RUS 2. Дана квадратная матрица. Вывести на экран элементы, стоящие на диагонали. + public static void main(String[] args) { + try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int strings = Integer.parseInt(reader.readLine()); + System.out.println("Enter quality of columns"); + int columns = Integer.parseInt(reader.readLine()); + int[][] matrix = new int[strings][columns]; + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + matrix[i][j] = (int) (Math.random() * 100) * positiveNegative; + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println(); + System.out.println("Elements of the main diagonal:"); + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + if (i == j) { + System.out.printf("%3d ", matrix[i][j]); + } + } + System.out.println(); + } + System.out.println(); + System.out.println("Side diagonal elements:"); + for (int i = matrix.length-1; i >= 0; i--) { + for (int j = 0; j < matrix[i].length; j++) { + if (i + j == matrix.length-1) { + System.out.printf("%3d ", matrix[i][j]); + } + } + System.out.println(); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} \ No newline at end of file diff --git a/Task13/Task13.iml b/Task13/Task13.iml new file mode 100644 index 0000000..6436e6e --- /dev/null +++ b/Task13/Task13.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task13/pom.xml b/Task13/pom.xml new file mode 100644 index 0000000..af1a24c --- /dev/null +++ b/Task13/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + 2_Algoriyhmization + Task#13 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task13/src/main/java/Task_13.java b/Task13/src/main/java/Task_13.java new file mode 100644 index 0000000..472af20 --- /dev/null +++ b/Task13/src/main/java/Task_13.java @@ -0,0 +1,10 @@ +public class Task_13 { + public static void main(String[] args) { + // 3. Дана матрица. Вывести k-ю строку и p-й столбец матрицы. + + + + + + } +} From df4a29c7becfe85a557d2b6660618429c543e33b Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Mon, 19 Aug 2019 17:44:40 +0300 Subject: [PATCH 33/70] First commit for Task_13 --- Task13/Task13.iml | 2 +- Task13/pom.xml | 12 ++++++++ Task13/src/main/java/Task_13.java | 48 ++++++++++++++++++++++++++++--- 3 files changed, 57 insertions(+), 5 deletions(-) diff --git a/Task13/Task13.iml b/Task13/Task13.iml index 6436e6e..d111749 100644 --- a/Task13/Task13.iml +++ b/Task13/Task13.iml @@ -1,6 +1,6 @@ - + diff --git a/Task13/pom.xml b/Task13/pom.xml index af1a24c..082cbf9 100644 --- a/Task13/pom.xml +++ b/Task13/pom.xml @@ -7,6 +7,18 @@ 2_Algoriyhmization Task#13 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + \ No newline at end of file diff --git a/Task13/src/main/java/Task_13.java b/Task13/src/main/java/Task_13.java index 472af20..1a50cd5 100644 --- a/Task13/src/main/java/Task_13.java +++ b/Task13/src/main/java/Task_13.java @@ -1,10 +1,50 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + public class Task_13 { + // ENG 3. The matrix is given. Print the kth row and pth column of the matrix + // RUS 3. Дана матрица. Вывести k-ю строку и p-й столбец матрицы public static void main(String[] args) { - // 3. Дана матрица. Вывести k-ю строку и p-й столбец матрицы. - - + try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int strings = Integer.parseInt(reader.readLine()); + System.out.println("Enter quality of strings"); + int columns = Integer.parseInt(reader.readLine()); + int[][] matrix = new int[strings][columns]; + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + matrix[i][j] = (int) (Math.random() * 100) * positiveNegative; + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println("Choose the string"); + int k = Integer.parseInt(reader.readLine()); + System.out.println("Choose the column"); + int p = Integer.parseInt(reader.readLine()); + System.out.println("The string is "); + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + if (i == k-1) + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println("The column is "); + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + if (j == p-1) + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + } catch (IOException e) { + e.printStackTrace(); + } } -} +} \ No newline at end of file From f5d0c42011316822051279a961ba2891b45ca478 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Mon, 19 Aug 2019 17:52:14 +0300 Subject: [PATCH 34/70] first commit for Task_14 --- Task14/Task14.iml | 15 +++++++++ Task14/pom.xml | 24 +++++++++++++++ Task14/src/main/java/Task_14.java | 51 +++++++++++++++++++++++++++++++ 3 files changed, 90 insertions(+) create mode 100644 Task14/Task14.iml create mode 100644 Task14/pom.xml create mode 100644 Task14/src/main/java/Task_14.java diff --git a/Task14/Task14.iml b/Task14/Task14.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task14/Task14.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task14/pom.xml b/Task14/pom.xml new file mode 100644 index 0000000..b36d2a4 --- /dev/null +++ b/Task14/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + 2_Algorithmization + Task#14 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task14/src/main/java/Task_14.java b/Task14/src/main/java/Task_14.java new file mode 100644 index 0000000..1334030 --- /dev/null +++ b/Task14/src/main/java/Task_14.java @@ -0,0 +1,51 @@ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +// Rus 4. Сформировать квадратную матрицу порядка n по заданному образцу(n - четное); +// Eng 4. Generate a square matrix of order n according to the given pattern (n is even); + +class Task_14 { + public static void main(String[] args) { + try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter the square matrix with even number n: "); + int n = Integer.parseInt(reader.readLine()); + int[][] matrix = new int[n][n]; + int count = 0; + int nDecriment = 0; + if (n % 2 == 0) { + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + if (i % 2 == 0) { + count++; + matrix[i][j] = count; + System.out.printf("%3d ", matrix[i][j]); + } else { + nDecriment++; + matrix[i][j] = (n+1) - nDecriment; + System.out.printf("%3d ", matrix[i][j]); + } + } + count = 0; + nDecriment = 0; + System.out.println(); + } + } else { + System.out.println("Number n is odd!"); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} + // Output + /* 1 2 3 4 5 6 7 8 + 8 7 6 5 4 3 2 1 + 1 2 3 4 5 6 7 8 + 8 7 6 5 4 3 2 1 + 1 2 3 4 5 6 7 8 + 8 7 6 5 4 3 2 1 + 1 2 3 4 5 6 7 8 + 8 7 6 5 4 3 2 1 + */ From 3bbb1132da71a1e218a5f5dd5f3d1a7d2ccadee0 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Mon, 19 Aug 2019 18:08:47 +0300 Subject: [PATCH 35/70] first commit Task_15 --- Task15/Task15.iml | 15 +++++++++ Task15/pom.xml | 24 +++++++++++++ Task15/src/main/java/Task_15.java | 56 +++++++++++++++++++++++++++++++ 3 files changed, 95 insertions(+) create mode 100644 Task15/Task15.iml create mode 100644 Task15/pom.xml create mode 100644 Task15/src/main/java/Task_15.java diff --git a/Task15/Task15.iml b/Task15/Task15.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task15/Task15.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task15/pom.xml b/Task15/pom.xml new file mode 100644 index 0000000..9518248 --- /dev/null +++ b/Task15/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + 2_Algorithmization + Task#15 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task15/src/main/java/Task_15.java b/Task15/src/main/java/Task_15.java new file mode 100644 index 0000000..cbc5ae9 --- /dev/null +++ b/Task15/src/main/java/Task_15.java @@ -0,0 +1,56 @@ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* + * Eng: Generate a square matrix of order n according to the given pattern (n is even): + * Rus: Сформировать квадратную матрицу порядка n по заданному образцу(n - четное): + * 1 1 1 ... 1 1 1 + * 2 2 2 ... 2 2 0 + * 3 3 3 ... 3 0 0 + * . . . ... . . . + * n-1 n-1 0 ... 0 0 0 + * n 0 0 ... 0 0 0 + */ + +class Task_15 { + public static void main(String[] args) { + try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter the square matrix with even number n: "); + int n = Integer.parseInt(reader.readLine()); + int[][] matrix = new int[n][n]; + if (n % 2 == 0) { + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + if (i > 0) { + if (n - (i + j) <= 0) { + matrix[i][j] = 0; + } else { + matrix[i][j] = i + 1; + } + System.out.printf("%3d ", matrix[i][j]); + } + else { + matrix[i][j] = 1; + System.out.printf("%3d ", matrix[i][j]); + } + } + System.out.println(); + } + } else { + System.out.println("Number n is odd!"); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} + /* Output: + 1 1 1 1 1 1 + 2 2 2 2 2 0 + 3 3 3 3 0 0 + 4 4 4 0 0 0 + 5 5 0 0 0 0 + 6 0 0 0 0 0 + */ \ No newline at end of file From 95d6fd827849947a0fb16021712c5f20ca31e631 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Wed, 21 Aug 2019 10:30:43 +0300 Subject: [PATCH 36/70] Update README.md --- README.md | 62 ++++++++++++++++++++++++++++++++++++++++++++++++++++++- 1 file changed, 61 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 9fbb497..c0b8012 100644 --- a/README.md +++ b/README.md @@ -81,5 +81,65 @@ public class Task_11 { } } } - ``` +______________________________________________________________________________________________________________________________ +``` java +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* Eng: + In the numerical matrix, swap two columns of any column, + i.e., put all the elements of one column at the corresponding + positions of the other, and move the elements of the second to the first. + Column numbers are entered by the user from the keyboard. + */ +/* Rus: + В числовой матрице поменять местами два столбца любых столбца, + т. е. все элементы одного столбца поставить на соответствующие + им позиции другого, а его элементы второго переместить в первый. + Номера столбцов вводит пользователь с клавиатуры. + */ +public class Task_17 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int n = Integer.parseInt(read.readLine()); + System.out.println("Enter quality of columns"); + int m = Integer.parseInt(read.readLine()); + int[][] matrix = new int[n][m]; + int swap; + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + matrix[i][j] = (int) (Math.random() * 100) * positiveNegative; + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println(); + System.out.println("Choose the number 1 of column that you want to change: "); + int s = Integer.parseInt(read.readLine()) - 1; + System.out.println("Choose the number 2 of column that you want to change: "); + int z = Integer.parseInt(read.readLine()) - 1; + + for (int i = 0; i < matrix.length; i++) { + swap = matrix[i][s]; + matrix[i][s] = matrix[i][z]; + matrix[i][z] = swap; + } + + for (int[] array : matrix) { + for (int element : array) { + System.out.printf("%3d ", element); + } + System.out.println(); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} +__________________________________________________________________________________________________________________________________ + +``` From 0571c3704ca8c00d36a5e9a4cd70d76813252973 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Wed, 21 Aug 2019 10:34:54 +0300 Subject: [PATCH 37/70] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index c0b8012..39d7052 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # 2_Algorithmization Описание файлов: - - Practice (tasks).pdf - файл содержит список задач, которые нужно решить для завершения этапа. + - [Practice (tasks).pdf](https://drive.google.com/file/d/1EIDMT_GgnzgORfQauELjavOSmMVfpoHK/view) - файл содержит список задач, которые нужно решить для завершения этапа. - Questions.pdf - файл содержит вопросы, на которые нужно уметь отвечать по завершению этапа. - Recommendations.pdf - файл содержит рекомендуемые материалы (видео и книги), к которым следует обратиться при возникновении трудностей при решении задач или ответах на вопросы. From 0d3389ebc0991a2eb46bbae5f14ff0f179b6beda Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Wed, 21 Aug 2019 15:40:10 +0300 Subject: [PATCH 38/70] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 39d7052..fe15c7b 100644 --- a/README.md +++ b/README.md @@ -100,7 +100,7 @@ import java.io.InputStreamReader; им позиции другого, а его элементы второго переместить в первый. Номера столбцов вводит пользователь с клавиатуры. */ -public class Task_17 { +public class Task_18 { public static void main(String[] args) { try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { System.out.println("Enter quality of strings"); From 0aa1eb4eb11d585cc7a174f06030ae5dce3075f9 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Wed, 21 Aug 2019 21:15:04 +0300 Subject: [PATCH 39/70] common commit for Task18-22 --- .gitignore | 3 +- Task16/Task16.iml | 15 ++++++ Task16/pom.xml | 24 +++++++++ Task16/src/main/java/Task_16.java | 42 ++++++++++++++++ Task17/Task17.iml | 15 ++++++ Task17/pom.xml | 24 +++++++++ Task17/src/main/java/Task_17.java | 41 ++++++++++++++++ Task18/Task18.iml | 15 ++++++ Task18/pom.xml | 24 +++++++++ Task18/src/main/java/Task_18_.java | 56 +++++++++++++++++++++ Task19/Task19.iml | 15 ++++++ Task19/pom.xml | 24 +++++++++ Task19/src/main/java/Task_19.java | 77 +++++++++++++++++++++++++++++ Task20/Task20.iml | 15 ++++++ Task20/pom.xml | 24 +++++++++ Task20/src/main/java/Task_20.java | 59 ++++++++++++++++++++++ Task21/Task21.iml | 15 ++++++ Task21/pom.xml | 24 +++++++++ Task21/src/main/java/Task_21.java | 37 ++++++++++++++ Task22/Task22.iml | 15 ++++++ Task22/pom.xml | 24 +++++++++ Task22/src/main/java/Task_22.java | 79 ++++++++++++++++++++++++++++++ 22 files changed, 666 insertions(+), 1 deletion(-) create mode 100644 Task16/Task16.iml create mode 100644 Task16/pom.xml create mode 100644 Task16/src/main/java/Task_16.java create mode 100644 Task17/Task17.iml create mode 100644 Task17/pom.xml create mode 100644 Task17/src/main/java/Task_17.java create mode 100644 Task18/Task18.iml create mode 100644 Task18/pom.xml create mode 100644 Task18/src/main/java/Task_18_.java create mode 100644 Task19/Task19.iml create mode 100644 Task19/pom.xml create mode 100644 Task19/src/main/java/Task_19.java create mode 100644 Task20/Task20.iml create mode 100644 Task20/pom.xml create mode 100644 Task20/src/main/java/Task_20.java create mode 100644 Task21/Task21.iml create mode 100644 Task21/pom.xml create mode 100644 Task21/src/main/java/Task_21.java create mode 100644 Task22/Task22.iml create mode 100644 Task22/pom.xml create mode 100644 Task22/src/main/java/Task_22.java diff --git a/.gitignore b/.gitignore index 00c529e..b7ee812 100644 --- a/.gitignore +++ b/.gitignore @@ -1,3 +1,4 @@ .idea/ target/ -*.iml/ \ No newline at end of file +*.iml/ +pom.xml/ \ No newline at end of file diff --git a/Task16/Task16.iml b/Task16/Task16.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task16/Task16.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task16/pom.xml b/Task16/pom.xml new file mode 100644 index 0000000..2092ea8 --- /dev/null +++ b/Task16/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + 2_Algoithmization + Task#16 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task16/src/main/java/Task_16.java b/Task16/src/main/java/Task_16.java new file mode 100644 index 0000000..4aab78a --- /dev/null +++ b/Task16/src/main/java/Task_16.java @@ -0,0 +1,42 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* Eng: Generate a square matrix of order n according to the given pattern (n is even): + * Rus: Сформировать квадратную матрицу порядка n по заданному образцу(n - четное): + * 1 1 1 ... 1 1 1 + * 0 1 1 ... 1 1 0 + * 0 0 1 ... 1 0 0 + * . . . ... . . . + * 0 1 1 ... 1 1 0 + * 1 1 1 ... 1 1 1 + */ +public class Task_16 { + public static void main(String[] args) { + try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter the square matrix with even number n: "); + int n = Integer.parseInt(reader.readLine()); + int[][] matrix = new int[n][n]; + + if (n % 2 == 0) { + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + if ((j >= i && j + i < n ) || ( j <= i && j + i >= n - 1)) { + matrix[i][j] = 1; + } else { + matrix[i][j] = 0; + } + System.out.printf("%2d ", matrix[i][j]); + } + System.out.println(); + } + } else { + System.out.println(" Nnumber N is odd "); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} + + \ No newline at end of file diff --git a/Task17/Task17.iml b/Task17/Task17.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task17/Task17.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task17/pom.xml b/Task17/pom.xml new file mode 100644 index 0000000..d34ae4c --- /dev/null +++ b/Task17/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#17 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task17/src/main/java/Task_17.java b/Task17/src/main/java/Task_17.java new file mode 100644 index 0000000..43b0fef --- /dev/null +++ b/Task17/src/main/java/Task_17.java @@ -0,0 +1,41 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* + * Сформировать квадратную матрицу порядка N по правилу: + * A[I,J] = sin((I^2 - J^2) / N) + * и подсчитать количество положительных элементов в ней. + */ + +public class Task_17 { + public static void main(String[] args) { + try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter the square matrix with even number n: "); + int n = Integer.parseInt(reader.readLine()); + double [][] matrix = new double[n][n]; + int count; + + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + matrix[i][j] = Math.sin((i * i - j * j) / n); + System.out.printf("%10f",matrix[i][j]); + } + System.out.println(); + } + + count = 0; + for (double [] array : matrix) { + for (double element : array) { + if (element > 0) { + count++; + } + } + } + System.out.printf("%n Amount of positive numbers: %d", count); + + } catch (IOException e) { + e.printStackTrace(); + } + } +} \ No newline at end of file diff --git a/Task18/Task18.iml b/Task18/Task18.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task18/Task18.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task18/pom.xml b/Task18/pom.xml new file mode 100644 index 0000000..caf7cea --- /dev/null +++ b/Task18/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#18 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task18/src/main/java/Task_18_.java b/Task18/src/main/java/Task_18_.java new file mode 100644 index 0000000..fbb39e9 --- /dev/null +++ b/Task18/src/main/java/Task_18_.java @@ -0,0 +1,56 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* Eng: + In the numerical matrix, swap two columns of any column, + i.e., put all the elements of one column at the corresponding + positions of the other, and move the elements of the second to the first. + Column numbers are entered by the user from the keyboard. + */ +/* Rus: + В числовой матрице поменять местами два столбца любых столбца, + т. е. все элементы одного столбца поставить на соответствующие + им позиции другого, а его элементы второго переместить в первый. + Номера столбцов вводит пользователь с клавиатуры. + */ +public class Task_18_ { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int n = Integer.parseInt(read.readLine()); + System.out.println("Enter quality of columns"); + int m = Integer.parseInt(read.readLine()); + int[][] matrix = new int[n][m]; + int swap; + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + matrix[i][j] = (int) (Math.random() * 100) * positiveNegative; + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println(); + System.out.println("Choose the number 1 of column that you want to change: "); + int s = Integer.parseInt(read.readLine()) - 1; + System.out.println("Choose the number 2 of column that you want to change: "); + int z = Integer.parseInt(read.readLine()) - 1; + + for (int i = 0; i < matrix.length; i++) { + swap = matrix[i][s]; + matrix[i][s] = matrix[i][z]; + matrix[i][z] = swap; + } + + for (int[] array : matrix) { + for (int element : array) { + System.out.printf("%3d ", element); + } + System.out.println(); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} \ No newline at end of file diff --git a/Task19/Task19.iml b/Task19/Task19.iml new file mode 100644 index 0000000..a26a8bb --- /dev/null +++ b/Task19/Task19.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task19/pom.xml b/Task19/pom.xml new file mode 100644 index 0000000..1b0a26a --- /dev/null +++ b/Task19/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task_19 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task19/src/main/java/Task_19.java b/Task19/src/main/java/Task_19.java new file mode 100644 index 0000000..0e22730 --- /dev/null +++ b/Task19/src/main/java/Task_19.java @@ -0,0 +1,77 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* Eng: + A matrix of non-negative numbers is given. +         Calculate the sum of the elements in each column. +         Determine which column contains the maximum amount. + */ +/* Rus: + Задана матрица неотрицательных чисел. + Посчитать сумму элементов в каждом столбце. + Определить, какой столбец содержит максимальную сумму. + */ +public class Task_19 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int n = Integer.parseInt(read.readLine()); + System.out.println("Enter quality of columns"); + int m = Integer.parseInt(read.readLine()); + int[][] matrix = new int[n][m]; + + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + matrix[i][j] = (int) (Math.random() * 100); + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println(); + + int maxColumn = 1; + int maxSum = 0; + int sum = 0; + for (int j = 0; j < matrix[0].length; j++) { + for (int i = 0; i < matrix.length; i++) { + sum += matrix[i][j]; + } + System.out.printf("%nThe sum elements in column is №%d: %d", j + 1, sum); + if (sum > maxSum) { + maxSum = sum; + maxColumn = j + 1; + } + sum = 0; + } + + System.out.printf("\n\nColumn №%d consists max sum.", maxColumn); + + } catch (IOException e) { + e.printStackTrace(); + } + } +} + +/* Example of output: + + Enter quality of strings + 5 + Enter quality of columns + 5 + + 50 62 28 9 96 + 55 92 83 85 47 + 41 80 62 3 92 + 30 2 24 97 29 + 94 57 96 75 62 + + The sum elements in column is №1: 270 + The sum elements in column is №2: 293 + The sum elements in column is №3: 293 + The sum elements in column is №4: 269 + The sum elements in column is №5: 326 + + Column №5 consists max sum. + + */ diff --git a/Task20/Task20.iml b/Task20/Task20.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task20/Task20.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task20/pom.xml b/Task20/pom.xml new file mode 100644 index 0000000..a6107f5 --- /dev/null +++ b/Task20/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#20 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task20/src/main/java/Task_20.java b/Task20/src/main/java/Task_20.java new file mode 100644 index 0000000..8acf320 --- /dev/null +++ b/Task20/src/main/java/Task_20.java @@ -0,0 +1,59 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* Eng: + A matrix of non-negative numbers is given. +         Calculate the sum of the elements in each column. +         Determine which column contains the maximum amount. + */ +/* Rus: + Задана матрица неотрицательных чисел. + Посчитать сумму элементов в каждом столбце. + Определить, какой столбец содержит максимальную сумму. + */ +public class Task_20 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int n = Integer.parseInt(read.readLine()); + System.out.println("Enter quality of columns"); + int m = Integer.parseInt(read.readLine()); + int[][] matrix = new int[n][m]; + + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + + int positiveNegative = Math.random()<0.5?-1:1; + matrix[i][j] = (int) (Math.random()* 100)*positiveNegative; + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println(); + + System.out.println("\nPositive elements of main diagonal : "); + for (int i = 0; i < matrix.length; i++) { + if (matrix[i][i] > 0) { + System.out.printf("%d, ", matrix[i][i]); + } + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} +/* Example of output: + Enter quality of strings + 5 + Enter quality of columns + 6 + + -11 -16 10 -30 -8 -26 + -96 -53 41 95 -75 1 + 49 7 42 -51 0 25 + -29 57 -4 18 7 16 + -27 87 -59 -52 83 58 + + Positive elements of main diagonal: + 42, 18, 83, + */ \ No newline at end of file diff --git a/Task21/Task21.iml b/Task21/Task21.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task21/Task21.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task21/pom.xml b/Task21/pom.xml new file mode 100644 index 0000000..c1fbbc5 --- /dev/null +++ b/Task21/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#21 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task21/src/main/java/Task_21.java b/Task21/src/main/java/Task_21.java new file mode 100644 index 0000000..5f56ef5 --- /dev/null +++ b/Task21/src/main/java/Task_21.java @@ -0,0 +1,37 @@ +/* Eng: + Fill the 10x20 matrix with random numbers from 0 to 15. +         Display the matrix itself and row numbers, in +         of which the number 5 occurs three or more times + + Rus: + Матрицу 10x20 заполнить случайными числами от 0 до 15. + Вывести на экран саму матрицу и номера строк, в + которых число 5 встречается три и более раз + */ +public class Task_21 { + public static void main(String[] args) { + int[][] matrix = new int[10][20]; + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + matrix[i][j] = (int) (Math.random() * 15); + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println(); + int count; + System.out.println("\nNumber of string, where digit 5 meets three or more times: "); + for (int i = 0; i < matrix.length; i++) { + count = 0; + for (int j = 0; j < matrix[i].length; j++) { + if (matrix[i][j] == 5) { + count++; + } + } + if (count >= 3) { + System.out.printf("%d, ", i + 1); + } + } + System.out.println("\b\b"); + } +} \ No newline at end of file diff --git a/Task22/Task22.iml b/Task22/Task22.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task22/Task22.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task22/pom.xml b/Task22/pom.xml new file mode 100644 index 0000000..afeffce --- /dev/null +++ b/Task22/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#22 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task22/src/main/java/Task_22.java b/Task22/src/main/java/Task_22.java new file mode 100644 index 0000000..ef63e94 --- /dev/null +++ b/Task22/src/main/java/Task_22.java @@ -0,0 +1,79 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* Eng: + Sort matrix rows in ascending and descending order of element values. + */ +/* Rus: + Отсортировать строки матрицы по возрастанию и убыванию значений элементов. + */ +public class Task_22 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int n = Integer.parseInt(read.readLine()); + System.out.println("Enter quality of columns"); + int m = Integer.parseInt(read.readLine()); + int[][] matrix = new int[n][m]; + + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + + int positiveNegative = Math.random()<0.5?-1:1; + matrix[i][j] = (int) (Math.random()* 100)*positiveNegative; + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println(); + + boolean isSorted; + int swap; + System.out.println("Sorting by ascending "); + for (int i = 0; i < matrix.length; i++) { + isSorted = false; + while (!isSorted) { + isSorted = true; + for (int j = 0; j < matrix[i].length - 1; j++) { + if (matrix[i][j] > matrix[i][j + 1]) { + isSorted = false; + swap = matrix[i][j]; + matrix[i][j] = matrix[i][j + 1]; + matrix[i][j + 1] = swap; + } + } + } + } + for (int[] ints : matrix) { + for (int anInt : ints) { + System.out.printf("%3d ", anInt); + } + System.out.println(); + } + + System.out.println("\nSorting by descending "); + for (int i = 0; i < matrix.length; i++) { + isSorted = false; + while (!isSorted) { + isSorted = true; + for (int j = 0; j < matrix[i].length - 1; j++) { + if (matrix[i][j] < matrix[i][j + 1]) { + isSorted = false; + swap = matrix[i][j]; + matrix[i][j] = matrix[i][j + 1]; + matrix[i][j + 1] = swap; + } + } + } + } + for (int[] ints : matrix) { + for (int anInt : ints) { + System.out.printf("%3d ", anInt); + } + System.out.println(); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} \ No newline at end of file From 66ee4906aba6c8b01dabc396f9fb808a8c11a10c Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 22 Aug 2019 21:18:12 +0300 Subject: [PATCH 40/70] commit for tasks 23-25 --- Task22/src/main/java/Task_22.java | 3 +- Task23/Task23.iml | 15 +++ Task23/pom.xml | 24 +++++ Task23/src/main/java/Task_23.java | 79 +++++++++++++++ Task24/Task24.iml | 15 +++ Task24/pom.xml | 24 +++++ Task24/src/main/java/Task_24.java | 43 ++++++++ Task25/Task25.iml | 15 +++ Task25/pom.xml | 24 +++++ Task25/src/main/java/Task_25.java | 79 +++++++++++++++ Task26/Task26.iml | 15 +++ Task26/pom.xml | 24 +++++ Task26/src/main/java/Task_26.java | 161 ++++++++++++++++++++++++++++++ 13 files changed, 520 insertions(+), 1 deletion(-) create mode 100644 Task23/Task23.iml create mode 100644 Task23/pom.xml create mode 100644 Task23/src/main/java/Task_23.java create mode 100644 Task24/Task24.iml create mode 100644 Task24/pom.xml create mode 100644 Task24/src/main/java/Task_24.java create mode 100644 Task25/Task25.iml create mode 100644 Task25/pom.xml create mode 100644 Task25/src/main/java/Task_25.java create mode 100644 Task26/Task26.iml create mode 100644 Task26/pom.xml create mode 100644 Task26/src/main/java/Task_26.java diff --git a/Task22/src/main/java/Task_22.java b/Task22/src/main/java/Task_22.java index ef63e94..b0917d5 100644 --- a/Task22/src/main/java/Task_22.java +++ b/Task22/src/main/java/Task_22.java @@ -1,12 +1,14 @@ import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; + /* Eng: Sort matrix rows in ascending and descending order of element values. */ /* Rus: Отсортировать строки матрицы по возрастанию и убыванию значений элементов. */ + public class Task_22 { public static void main(String[] args) { try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { @@ -18,7 +20,6 @@ public static void main(String[] args) { for (int i = 0; i < matrix.length; i++) { for (int j = 0; j < matrix[i].length; j++) { - int positiveNegative = Math.random()<0.5?-1:1; matrix[i][j] = (int) (Math.random()* 100)*positiveNegative; System.out.printf("%3d ", matrix[i][j]); diff --git a/Task23/Task23.iml b/Task23/Task23.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task23/Task23.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task23/pom.xml b/Task23/pom.xml new file mode 100644 index 0000000..3211850 --- /dev/null +++ b/Task23/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#23 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task23/src/main/java/Task_23.java b/Task23/src/main/java/Task_23.java new file mode 100644 index 0000000..342c020 --- /dev/null +++ b/Task23/src/main/java/Task_23.java @@ -0,0 +1,79 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* Eng: + Sort matrix columns in ascending and descending order of element values. + */ +/* Rus: + Отсортировать столбцы матрицы по возрастанию и убыванию значений элементов. + */ + +public class Task_23 { + public static void main(String[] args) { + + boolean isSorted; + int swap; + + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int n = Integer.parseInt(read.readLine()); + System.out.println("Enter quality of columns"); + int m = Integer.parseInt(read.readLine()); + int[][] matrix = new int[n][m]; + + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + int positiveNegative = Math.random()<0.5?-1:1; + matrix[i][j] = (int) (Math.random()* 100)*positiveNegative; + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + System.out.println("\nSorting by ascending "); + for (int j = 0; j < matrix[0].length; j++) { + isSorted = false; + while (!isSorted) { + isSorted = true; + for (int i = 0; i < matrix.length - 1; i++) { + if (matrix[i][j] > matrix[i + 1][j]) { + isSorted = false; + swap = matrix[i][j]; + matrix[i][j] = matrix[i + 1][j]; + matrix[i + 1][j] = swap; + } + } + } + } + for (int[] ints : matrix) { + for (int anInt : ints) { + System.out.printf("%3d ", anInt); + } + System.out.println(); + } + System.out.println("\nSorting by descending "); + for (int j = 0; j < matrix[0].length; j++) { + isSorted = false; + while (!isSorted) { + isSorted = true; + for (int i = 0; i < matrix.length - 1; i++) { + if (matrix[i][j] < matrix[i + 1][j]) { + isSorted = false; + swap = matrix[i][j]; + matrix[i][j] = matrix[i + 1][j]; + matrix[i + 1][j] = swap; + } + } + } + } + for (int[] ints : matrix) { + for (int anInt : ints) { + System.out.printf("%3d ", anInt); + } + System.out.println(); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} \ No newline at end of file diff --git a/Task24/Task24.iml b/Task24/Task24.iml new file mode 100644 index 0000000..d111749 --- /dev/null +++ b/Task24/Task24.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task24/pom.xml b/Task24/pom.xml new file mode 100644 index 0000000..38cf268 --- /dev/null +++ b/Task24/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#24 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task24/src/main/java/Task_24.java b/Task24/src/main/java/Task_24.java new file mode 100644 index 0000000..ba9f24d --- /dev/null +++ b/Task24/src/main/java/Task_24.java @@ -0,0 +1,43 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* Eng: + Generate a random matrix m x n consisting of zeros and ones, + with a number in each column units equals column number. + */ +/* Rus: + Сформировать случайную матрицу m x n, состоящую из нулей и единиц, + причем в каждом столбце число единиц равно номеру столбца. + */ + +class Task_24 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int n = Integer.parseInt(read.readLine()); + System.out.println("Enter quality of columns equals quality of strings "); + int m = Integer.parseInt(read.readLine()); + int[][] matrix = new int[n][m]; + + if(m == n) { + int count; + for (int i = 0; i < matrix.length; i++) { + count = i + 1; + for (int j = 0; j < matrix[i].length; j++) { + if (count - 1 > 0) { + matrix[i][j] = 0; + count--; + } else { + matrix[i][j] = 1; + } + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + }else System.out.println("If you want to get correct answer please enter m = n! "); + } catch (IOException e) { + e.printStackTrace(); + } + } +} diff --git a/Task25/Task25.iml b/Task25/Task25.iml new file mode 100644 index 0000000..d04ccda --- /dev/null +++ b/Task25/Task25.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task25/pom.xml b/Task25/pom.xml new file mode 100644 index 0000000..5e8ea0d --- /dev/null +++ b/Task25/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + 2_Algorithmization + Task#25 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task25/src/main/java/Task_25.java b/Task25/src/main/java/Task_25.java new file mode 100644 index 0000000..3d0c6a6 --- /dev/null +++ b/Task25/src/main/java/Task_25.java @@ -0,0 +1,79 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* Eng: + Find the largest element of the matrix and replace all odd elements with it + */ +/* Rus: + Найдите наибольший элемент матрицы и заменить все нечетные элементы на него. + */ + +public class Task_25 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quantity of strings"); + int n = Integer.parseInt(read.readLine()); + System.out.println("Enter quantity of columns"); + int m = Integer.parseInt(read.readLine()); + int[][] matrix = new int[n][m]; + + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + int positiveNegative = Math.random()<0.5?-1:1; + matrix[i][j] = (int) (Math.random()* 100)*positiveNegative; + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + + System.out.println(); + int max = Integer.MIN_VALUE; + for (int [] array : matrix) { + for (int element : array) { + if (element > max) { + max = element; + } + } + } + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + if (matrix[i][j] % 2 != 0) { + matrix[i][j] = max; + } + } + } + for (int[] array : matrix) { + for (int element : array) { + System.out.printf("%3d ", element); + } + System.out.println(); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} + +/* +Example of output: + + Enter quantity of strings + 6 + Enter quantity of columns + 7 + + -79 82 -7 81 89 42 48 + 40 -1 0 48 -30 -8 -42 + 6 98 -65 -67 14 -1 -37 + -44 18 17 -78 -91 -43 -70 + 60 -80 -80 16 84 79 20 + -75 50 83 80 42 -73 26 + + 98 82 98 98 98 42 48 + 40 98 0 48 -30 -8 -42 + 6 98 98 98 14 98 98 + -44 18 98 -78 98 98 -70 + 60 -80 -80 16 84 98 20 + 98 50 98 80 42 98 26 +*/ diff --git a/Task26/Task26.iml b/Task26/Task26.iml new file mode 100644 index 0000000..d04ccda --- /dev/null +++ b/Task26/Task26.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task26/pom.xml b/Task26/pom.xml new file mode 100644 index 0000000..10944fc --- /dev/null +++ b/Task26/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#26 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task26/src/main/java/Task_26.java b/Task26/src/main/java/Task_26.java new file mode 100644 index 0000000..1a6d35e --- /dev/null +++ b/Task26/src/main/java/Task_26.java @@ -0,0 +1,161 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + +A magic square of order n is a square matrix of size n x n composed of numbers 1, 2, 3, +         ..., n 2 so that the sums for each column, each row and each of the two large diagonals are equal between +         by myself. Build such a square. +         An example of a magic square of order 3: +         6 1 8 +         7 5 3 +         2 9 4 + + Магическим квадратом порядка n называется квадратная матрица размера n x n, составленная из чисел 1, 2, 3, + ..., n 2 так, что суммы по каждому столбцу, каждой строке и каждой из двух больших диагоналей равны между + собой. Построить такой квадрат. + Пример магического квадрата порядка 3: + 6 1 8 + 7 5 3 + 2 9 4 + */ +public class Task_26 { + public static void main(String[] args) { + + try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { + + int [][] square; + int n; + + System.out.println("Create an order of magic square: "); + n = Integer.parseInt(reader.readLine()); + + while (n < 3) { + System.out.printf("Magic square an order %d not exist %n", n); + System.out.println("Create new order of magic square: "); + n = Integer.parseInt(reader.readLine()); + } + if ((n - 1) % 2 == 0) { + square = oddMagicSquare(n); + } else if (n % 4 == 0) { + square = evenMagicSquare(n); + } else { + square = evenOddMagicSquare(n); + } + System.out.println("\nTo get magic square: "); + printMatrix(square); + + } catch (IOException e) { + e.printStackTrace(); + } + } + private static int [][] oddMagicSquare (int n){ + int [][] square = new int[n][n]; + int i = 0; + int j = (n - 1) / 2; + square[i--][j++] = 1; + for (int k = 2; k <= n * n; i--, j++, k++) { + if (i < 0 && j > n - 1) { + i += 2; + j--; + } + if (i < 0) { + i = n - 1; + } + if (j > n - 1) { + j = 0; + } + if (square[i][j] != 0) { + i += 2; + j--; + } + square[i][j] = k; + } + return square; + } + private static int [][] evenMagicSquare (int n){ + int [][] square = new int[n][n]; + int temp; + int k = 1; + + for (int i = 0; i < square.length; i++) { + for (int j = 0; j < square.length; j++) { + square[i][j] = k; + k++; + } + } + + for (int i = 0; i < n; i += 4 ) { + for (int j = 1; j < n; j += 4) { + square[i][j] = n * n + 1 - square[i][j]; + square[i + 3][j] = n * n + 1 - square[i + 3][j]; + square[i][j + 1] = n * n + 1 - square[i][j + 1]; + square[i + 3][j + 1] = n * n + 1 - square[i + 3][j + 1]; + } + } + for (int i = 1; i < n; i += 4 ) { + for (int j = 0; j < n; j += 4) { + square[i][j] = n * n + 1 - square[i][j]; + square[i + 1][j] = n * n + 1 - square[i + 1][j]; + square[i][j + 3] = n * n + 1 - square[i][j + 3]; + square[i + 1][j + 3] = n * n + 1 - square[i + 1][j + 3]; + } + } + return square; + } + private static int [][] evenOddMagicSquare (int n){ + int [][] square = new int[n][n]; + int [][] squareT = evenMagicSquare(n - 2); + for (int i = 1; i < n - 1; i++) { + for (int j = 1; j < n - 1; j++) { + square[i][j] = squareT[i - 1][j - 1] + 2 * (n - 1); + } + } + int m = n / 2; + int d = n * n + 1; + + square[0][0] = 3 * m - 1; + square[0][n - 1] = 1; + square[n - 1][0] = d - 1; + square[n - 1][n - 1] = d - 3 * m + 1; + + int i, j; + for (i = 1; i <= m - 2; i++) { + square[0][i] = 2 * i + 1; + } + for (j = 1; j <= m; j++) { + square[0][j + i - 1] = d - 2 * j; + } + for (j = 1; j < n - 1; j++) { + square[n - 1][j] = n * n + 1 - square[0][j]; + } + square[1][0] = 2 * m - 1; + for (i = 1; i <= m / 2; i++) { + square[i + 1][0] = 3 * m - 1 - i; + } + i--; + for (j = 1; j <= m / 2 + 1; j++) { + square[i + j + 1][0] = d - 4 * m + 1 + j; + } + j--; + for (int q = 1; q <= m / 2 - 1; q++, i++){ + square[i + j + q + 1][0] = 3 * m - 1 + q; + square[i + j + q + 2][0] = d - 2 * m - q; + } + + for (i = 1; i < n - 1; i++) { + square[i][n - 1] = n * n + 1 - square[i][0]; + } + + return square; + } + + private static void printMatrix (int [][] square) { + for (int[] array : square) { + for (int element : array) { + System.out.printf("%4d ", element); + } + System.out.println(); + } + } +} \ No newline at end of file From c12fe68c4b7666b20c785e161df194b928f32361 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Sun, 25 Aug 2019 10:31:36 +0300 Subject: [PATCH 41/70] commit for Task_27 --- Task27/Task27.iml | 15 +++++++ Task27/pom.xml | 24 +++++++++++ Task27/src/main/java/Task_27.java | 70 +++++++++++++++++++++++++++++++ Task28/Task28.iml | 15 +++++++ Task28/pom.xml | 12 ++++++ 5 files changed, 136 insertions(+) create mode 100644 Task27/Task27.iml create mode 100644 Task27/pom.xml create mode 100644 Task27/src/main/java/Task_27.java create mode 100644 Task28/Task28.iml create mode 100644 Task28/pom.xml diff --git a/Task27/Task27.iml b/Task27/Task27.iml new file mode 100644 index 0000000..d04ccda --- /dev/null +++ b/Task27/Task27.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task27/pom.xml b/Task27/pom.xml new file mode 100644 index 0000000..f27d427 --- /dev/null +++ b/Task27/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#27 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task27/src/main/java/Task_27.java b/Task27/src/main/java/Task_27.java new file mode 100644 index 0000000..6801f94 --- /dev/null +++ b/Task27/src/main/java/Task_27.java @@ -0,0 +1,70 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + ENG: + Given two one-dimensional arrays with a different number of elements and a natural number k. Combine them into +        one array, including the second array between the kth and (k + 1) - m elements of the first, without using +        additional array. + + RUS: + 3.1 Заданы два одномерных массива с различным количеством элементов и натуральное число k. Объединить их в + один массив, включив второй массив между k-м и (k+1) - м элементами первого, при этом не используя + дополнительный массив. +*/ +public class Task_27 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + + System.out.println("Enter quantity an elements of first array: "); + int n = Integer.parseInt(read.readLine()); + int [] firstArray = new int [n]; + + for (int i = 0; i < firstArray.length; i++) { + firstArray[i]= (int) (Math.random()*100)-50; + System.out.print(firstArray[i] + ", "); + } + + System.out.println("\n\nEnter quantity an elements of second array: "); + int m = Integer.parseInt(read.readLine()); + int [] secondArray = new int [m]; + + for (int i = 0; i < secondArray.length; i++) { + secondArray[i]= (int) (Math.random()*100)-50; + System.out.print(secondArray[i] + ", "); + } + + System.out.println("\n\nChoose number from first array: "); + int k = Integer.parseInt(read.readLine()); + + System.out.println("\n\nResult of joining two arrays : "); + for (int i = 0; i < firstArray.length; i++) { + System.out.print(firstArray[i] + ", "); + if (k == firstArray[i]) { + for (int j = 0; j < secondArray.length; j++) { + System.out.print(secondArray[j] + ", "); + } + } + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} +/* + Example of output: + Enter quantity an elements of first array: + 8 + 31, -21, 22, -10, 5, 2, 30, -40, + + Enter quantity an elements of second array: + 9 + -27, -27, 22, 49, 22, -17, 16, -41, 5, + + Choose number from first array: + 22 + + Result of joining two arrays : + 31, -21, 22, -27, -27, 22, 49, 22, -17, 16, -41, 5, -10, 5, 2, 30, -40, + + */ diff --git a/Task28/Task28.iml b/Task28/Task28.iml new file mode 100644 index 0000000..8d8ffd9 --- /dev/null +++ b/Task28/Task28.iml @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/Task28/pom.xml b/Task28/pom.xml new file mode 100644 index 0000000..012915f --- /dev/null +++ b/Task28/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#28 + 1.0-SNAPSHOT + + + \ No newline at end of file From 0ba38892edd24f08ad8d8485837b80ad91442d85 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Sun, 25 Aug 2019 14:41:26 +0300 Subject: [PATCH 42/70] Commit for Task_28 --- {Task1 => Task01}/Task1.iml | 0 {Task1 => Task01}/pom.xml | 0 {Task1 => Task01}/src/main/java/Task_1.java | 0 {Task2 => Task02}/Task2.iml | 0 {Task2 => Task02}/pom.xml | 0 {Task2 => Task02}/src/main/java/Task_2.java | 0 {Task3 => Task03}/Task3.iml | 0 {Task3 => Task03}/pom.xml | 0 {Task3 => Task03}/src/main/java/Task_3.java | 0 {Task4 => Task04}/Task4.iml | 0 {Task4 => Task04}/pom.xml | 0 {Task4 => Task04}/src/main/java/Task_4.java | 0 {Task5 => Task05}/Task5.iml | 0 {Task5 => Task05}/pom.xml | 0 {Task5 => Task05}/src/main/java/Task_5.java | 0 {Task6 => Task06}/Task6.iml | 0 {Task6 => Task06}/pom.xml | 0 {Task6 => Task06}/src/main/java/Task_6.java | 0 {Task8 => Task08}/src/main/java/Task_8.java | 0 {Task9 => Task09}/src/main/java/Task_9.java | 0 Task28/Task28.iml | 2 +- Task28/pom.xml | 12 ++++ Task28/src/main/java/Task_28.java | 65 +++++++++++++++++++++ 23 files changed, 78 insertions(+), 1 deletion(-) rename {Task1 => Task01}/Task1.iml (100%) rename {Task1 => Task01}/pom.xml (100%) rename {Task1 => Task01}/src/main/java/Task_1.java (100%) rename {Task2 => Task02}/Task2.iml (100%) rename {Task2 => Task02}/pom.xml (100%) rename {Task2 => Task02}/src/main/java/Task_2.java (100%) rename {Task3 => Task03}/Task3.iml (100%) rename {Task3 => Task03}/pom.xml (100%) rename {Task3 => Task03}/src/main/java/Task_3.java (100%) rename {Task4 => Task04}/Task4.iml (100%) rename {Task4 => Task04}/pom.xml (100%) rename {Task4 => Task04}/src/main/java/Task_4.java (100%) rename {Task5 => Task05}/Task5.iml (100%) rename {Task5 => Task05}/pom.xml (100%) rename {Task5 => Task05}/src/main/java/Task_5.java (100%) rename {Task6 => Task06}/Task6.iml (100%) rename {Task6 => Task06}/pom.xml (100%) rename {Task6 => Task06}/src/main/java/Task_6.java (100%) rename {Task8 => Task08}/src/main/java/Task_8.java (100%) rename {Task9 => Task09}/src/main/java/Task_9.java (100%) create mode 100644 Task28/src/main/java/Task_28.java diff --git a/Task1/Task1.iml b/Task01/Task1.iml similarity index 100% rename from Task1/Task1.iml rename to Task01/Task1.iml diff --git a/Task1/pom.xml b/Task01/pom.xml similarity index 100% rename from Task1/pom.xml rename to Task01/pom.xml diff --git a/Task1/src/main/java/Task_1.java b/Task01/src/main/java/Task_1.java similarity index 100% rename from Task1/src/main/java/Task_1.java rename to Task01/src/main/java/Task_1.java diff --git a/Task2/Task2.iml b/Task02/Task2.iml similarity index 100% rename from Task2/Task2.iml rename to Task02/Task2.iml diff --git a/Task2/pom.xml b/Task02/pom.xml similarity index 100% rename from Task2/pom.xml rename to Task02/pom.xml diff --git a/Task2/src/main/java/Task_2.java b/Task02/src/main/java/Task_2.java similarity index 100% rename from Task2/src/main/java/Task_2.java rename to Task02/src/main/java/Task_2.java diff --git a/Task3/Task3.iml b/Task03/Task3.iml similarity index 100% rename from Task3/Task3.iml rename to Task03/Task3.iml diff --git a/Task3/pom.xml b/Task03/pom.xml similarity index 100% rename from Task3/pom.xml rename to Task03/pom.xml diff --git a/Task3/src/main/java/Task_3.java b/Task03/src/main/java/Task_3.java similarity index 100% rename from Task3/src/main/java/Task_3.java rename to Task03/src/main/java/Task_3.java diff --git a/Task4/Task4.iml b/Task04/Task4.iml similarity index 100% rename from Task4/Task4.iml rename to Task04/Task4.iml diff --git a/Task4/pom.xml b/Task04/pom.xml similarity index 100% rename from Task4/pom.xml rename to Task04/pom.xml diff --git a/Task4/src/main/java/Task_4.java b/Task04/src/main/java/Task_4.java similarity index 100% rename from Task4/src/main/java/Task_4.java rename to Task04/src/main/java/Task_4.java diff --git a/Task5/Task5.iml b/Task05/Task5.iml similarity index 100% rename from Task5/Task5.iml rename to Task05/Task5.iml diff --git a/Task5/pom.xml b/Task05/pom.xml similarity index 100% rename from Task5/pom.xml rename to Task05/pom.xml diff --git a/Task5/src/main/java/Task_5.java b/Task05/src/main/java/Task_5.java similarity index 100% rename from Task5/src/main/java/Task_5.java rename to Task05/src/main/java/Task_5.java diff --git a/Task6/Task6.iml b/Task06/Task6.iml similarity index 100% rename from Task6/Task6.iml rename to Task06/Task6.iml diff --git a/Task6/pom.xml b/Task06/pom.xml similarity index 100% rename from Task6/pom.xml rename to Task06/pom.xml diff --git a/Task6/src/main/java/Task_6.java b/Task06/src/main/java/Task_6.java similarity index 100% rename from Task6/src/main/java/Task_6.java rename to Task06/src/main/java/Task_6.java diff --git a/Task8/src/main/java/Task_8.java b/Task08/src/main/java/Task_8.java similarity index 100% rename from Task8/src/main/java/Task_8.java rename to Task08/src/main/java/Task_8.java diff --git a/Task9/src/main/java/Task_9.java b/Task09/src/main/java/Task_9.java similarity index 100% rename from Task9/src/main/java/Task_9.java rename to Task09/src/main/java/Task_9.java diff --git a/Task28/Task28.iml b/Task28/Task28.iml index 8d8ffd9..d04ccda 100644 --- a/Task28/Task28.iml +++ b/Task28/Task28.iml @@ -1,6 +1,6 @@ - + diff --git a/Task28/pom.xml b/Task28/pom.xml index 012915f..f866d80 100644 --- a/Task28/pom.xml +++ b/Task28/pom.xml @@ -7,6 +7,18 @@ io.github.EugeneZakhno Task#28 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + \ No newline at end of file diff --git a/Task28/src/main/java/Task_28.java b/Task28/src/main/java/Task_28.java new file mode 100644 index 0000000..50b2ba6 --- /dev/null +++ b/Task28/src/main/java/Task_28.java @@ -0,0 +1,65 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* + ENG: + Two sequences a1 <= a2 <= a3 <= aN and b1 <= b2 <= b3 <= bM are given. To form a new sequence from them +    numbers so that it is also non-decreasing. Note. Do not use an additional array. + + RUS: + Даны две последовательности a1<=a2<=a3<=aN и b1<=b2<=b3<=bM. Образовать из них новую последовательность + чисел так, чтобы она тоже была неубывающей. Примечание. Дополнительный массив не использовать. +*/ + +public class Task_28 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quantity the elements of first sequence: "); + int n = Integer.parseInt(read.readLine()); + int[] firstArray = new int[n + 1]; + + for (int i = 1; i < firstArray.length; i++) { + firstArray[i] = firstArray[i - 1] + 1; + System.out.print(firstArray[i] + ", "); + } + + System.out.println("\n\nEnter quantity the elements of second sequence: "); + int m = Integer.parseInt(read.readLine()); + int[] secondArray = new int[m + 1]; + + for (int i = 1; i < secondArray.length; i++) { + secondArray[i] = secondArray[i - 1] + 2; + System.out.print(secondArray[i] + ", "); + } + + int[] joinArray = new int[firstArray.length + secondArray.length]; + + for (int i = 0; i < joinArray.length; i++) { + if (i < firstArray.length) { + joinArray[i] = firstArray[i]; + } else { + joinArray[i] = secondArray[i - firstArray.length]; + } + } + + for (int i = joinArray.length - 1; i > 0 ; i--) { + for (int j = 0; j < i; j++) { + if (joinArray[j] > joinArray[j + 1]) { + int temp = joinArray[j]; + joinArray[j] = joinArray[j + 1]; + joinArray[j + 1] = temp; + } + } + } + System.out.println("\n\nNew sequence: "); + for(int value : joinArray){ + System.out.print(value+ ", "); + } + + } catch(IOException e){ + e.printStackTrace(); + } + } +} + From 04760319245891965ebc24f9a56adf4281630b80 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Sun, 25 Aug 2019 20:37:53 +0300 Subject: [PATCH 43/70] Commit for Task_29 --- Task27/src/main/java/Task_27.java | 1 + Task28/src/main/java/Task_28.java | 1 + Task29/pom.xml | 22 +++++++++++++ Task29/src/main/java/Task_29.java | 51 +++++++++++++++++++++++++++++++ 4 files changed, 75 insertions(+) create mode 100644 Task29/pom.xml create mode 100644 Task29/src/main/java/Task_29.java diff --git a/Task27/src/main/java/Task_27.java b/Task27/src/main/java/Task_27.java index 6801f94..1a43532 100644 --- a/Task27/src/main/java/Task_27.java +++ b/Task27/src/main/java/Task_27.java @@ -51,6 +51,7 @@ public static void main(String[] args) { } } } + /* Example of output: Enter quantity an elements of first array: diff --git a/Task28/src/main/java/Task_28.java b/Task28/src/main/java/Task_28.java index 50b2ba6..e35a5e4 100644 --- a/Task28/src/main/java/Task_28.java +++ b/Task28/src/main/java/Task_28.java @@ -15,6 +15,7 @@ public class Task_28 { public static void main(String[] args) { try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quantity the elements of first sequence: "); int n = Integer.parseInt(read.readLine()); int[] firstArray = new int[n + 1]; diff --git a/Task29/pom.xml b/Task29/pom.xml new file mode 100644 index 0000000..17b1712 --- /dev/null +++ b/Task29/pom.xml @@ -0,0 +1,22 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#29 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + \ No newline at end of file diff --git a/Task29/src/main/java/Task_29.java b/Task29/src/main/java/Task_29.java new file mode 100644 index 0000000..f33e378 --- /dev/null +++ b/Task29/src/main/java/Task_29.java @@ -0,0 +1,51 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + ENG: + Sort by selection. Given a sequence of numbers a1 <= a2 <= a3 <= ... <= aN. It is required to rearrange the elements so +        so that they are in descending order. To do this, in the array, starting from the first, the largest +        the element is put in first place, and the first - in place of the largest. Then, starting from the second, this procedure +        repeated. Write a sorting algorithm by choice. + + RUS: + Cортировка выбором. Дана последовательность чисел a1<=a2<=a3<= ...<=aN .Требуется переставить элементы так, + чтобы они были расположены по убыванию. Для этого в массиве, начиная с первого, выбирается наибольший + элемент и ставится на первое место, а первый - на место наибольшего. Затем, начиная со второго, эта процедура + повторяется. Написать алгоритм сортировки выбором. + +*/ +public class Task_29 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + + System.out.println("Enter quantity the elements of first sequence: "); + int n = Integer.parseInt(read.readLine()); + int[] array = new int[n + 1]; + for (int i = 1; i < array.length; i++) { + array[i] = array[i - 1] + 3; + System.out.print(array[i] + ", "); + } + System.out.println(); + + int max; + int temp; + for (int i = 0; i < array.length; i++) { + max = i; + for (int j = i; j < array.length; j++) { + if (array[j] > array[max]) { + max = j; + } + } + temp = array[i]; + array[i] = array[max]; + array[max] = temp; + } + for (int value : array) + System.out.print(value + ", "); + + } catch (IOException e) { + e.printStackTrace(); + } + } +} From e43bbc120feb4bca9608b67683f967b8bcf8b53f Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Sun, 25 Aug 2019 21:02:35 +0300 Subject: [PATCH 44/70] Commit for Task_29 --- Commit_for_Task_29.patch | 114 ++++++++++++++++++++++++++++++ Task29/src/main/java/Task_29.java | 5 +- Task30/pom.xml | 24 +++++++ Task30/src/main/java/Task_31.java | 53 ++++++++++++++ 4 files changed, 194 insertions(+), 2 deletions(-) create mode 100644 Commit_for_Task_29.patch create mode 100644 Task30/pom.xml create mode 100644 Task30/src/main/java/Task_31.java diff --git a/Commit_for_Task_29.patch b/Commit_for_Task_29.patch new file mode 100644 index 0000000..cdf3476 --- /dev/null +++ b/Commit_for_Task_29.patch @@ -0,0 +1,114 @@ +Index: Task30/pom.xml +IDEA additional info: +Subsystem: com.intellij.openapi.diff.impl.patch.CharsetEP +<+>UTF-8 +=================================================================== +--- Task30/pom.xml (date 1566754829510) ++++ Task30/pom.xml (date 1566754829510) +@@ -0,0 +1,24 @@ ++ ++ ++ 4.0.0 ++ ++ io.github.EugeneZakhno ++ Task#30 ++ 1.0-SNAPSHOT ++ ++ ++ ++ org.apache.maven.plugins ++ maven-compiler-plugin ++ ++ 7 ++ 7 ++ ++ ++ ++ ++ ++ ++ +\ No newline at end of file +Index: Task30/src/main/java/Task_31.java +IDEA additional info: +Subsystem: com.intellij.openapi.diff.impl.patch.CharsetEP +<+>UTF-8 +=================================================================== +--- Task30/src/main/java/Task_31.java (date 1566754870102) ++++ Task30/src/main/java/Task_31.java (date 1566754870102) +@@ -0,0 +1,53 @@ ++import java.io.BufferedReader; ++import java.io.IOException; ++import java.io.InputStreamReader; ++/* ++ ENG: ++ Given two one-dimensional arrays with a different number of elements and a natural number k. Combine them into ++        one array, including the second array between the kth and (k + 1) - m elements of the first, without using ++        additional array. ++ ++ RUS: ++ 3.1 Заданы два одномерных массива с различным количеством элементов и натуральное число k. Объединить их в ++ один массив, включив второй массив между k-м и (k+1) - м элементами первого, при этом не используя ++ дополнительный массив. ++*/ ++public class Task_31 { ++ public static void main(String[] args) { ++ try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { ++ ++ System.out.println("Enter quantity an elements of first array: "); ++ int n = Integer.parseInt(read.readLine()); ++ int [] firstArray = new int [n]; ++ ++ for (int i = 0; i < firstArray.length; i++) { ++ firstArray[i]= (int) (Math.random()*100)-50; ++ System.out.print(firstArray[i] + ", "); ++ } ++ ++ System.out.println("\n\nEnter quantity an elements of second array: "); ++ int m = Integer.parseInt(read.readLine()); ++ int [] secondArray = new int [m]; ++ ++ for (int i = 0; i < secondArray.length; i++) { ++ secondArray[i]= (int) (Math.random()*100)-50; ++ System.out.print(secondArray[i] + ", "); ++ } ++ ++ System.out.println("\n\nChoose number from first array: "); ++ int k = Integer.parseInt(read.readLine()); ++ ++ System.out.println("\n\nResult of joining two arrays : "); ++ for (int i = 0; i < firstArray.length; i++) { ++ System.out.print(firstArray[i] + ", "); ++ if (k == firstArray[i]) { ++ for (int j = 0; j < secondArray.length; j++) { ++ System.out.print(secondArray[j] + ", "); ++ } ++ } ++ } ++ } catch (IOException e) { ++ e.printStackTrace(); ++ } ++ } ++} +\ No newline at end of file +Index: Task29/src/main/java/Task_29.java +IDEA additional info: +Subsystem: com.intellij.openapi.diff.impl.patch.CharsetEP +<+>UTF-8 +=================================================================== +--- Task29/src/main/java/Task_29.java (revision 04760319245891965ebc24f9a56adf4281630b80) ++++ Task29/src/main/java/Task_29.java (date 1566756071435) +@@ -41,8 +41,9 @@ + array[i] = array[max]; + array[max] = temp; + } +- for (int value : array) +- System.out.print(value + ", "); ++ for (int i = 0; i < array.length-1; i++) { ++ System.out.print(array[i] + ", "); ++ } + + } catch (IOException e) { + e.printStackTrace(); diff --git a/Task29/src/main/java/Task_29.java b/Task29/src/main/java/Task_29.java index f33e378..9ff7ac3 100644 --- a/Task29/src/main/java/Task_29.java +++ b/Task29/src/main/java/Task_29.java @@ -41,8 +41,9 @@ public static void main(String[] args) { array[i] = array[max]; array[max] = temp; } - for (int value : array) - System.out.print(value + ", "); + for (int i = 0; i < array.length-1; i++) { + System.out.print(array[i] + ", "); + } } catch (IOException e) { e.printStackTrace(); diff --git a/Task30/pom.xml b/Task30/pom.xml new file mode 100644 index 0000000..76d40c1 --- /dev/null +++ b/Task30/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#30 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task30/src/main/java/Task_31.java b/Task30/src/main/java/Task_31.java new file mode 100644 index 0000000..a8d60be --- /dev/null +++ b/Task30/src/main/java/Task_31.java @@ -0,0 +1,53 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + ENG: + Given two one-dimensional arrays with a different number of elements and a natural number k. Combine them into +        one array, including the second array between the kth and (k + 1) - m elements of the first, without using +        additional array. + + RUS: + 3.1 Заданы два одномерных массива с различным количеством элементов и натуральное число k. Объединить их в + один массив, включив второй массив между k-м и (k+1) - м элементами первого, при этом не используя + дополнительный массив. +*/ +public class Task_31 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + + System.out.println("Enter quantity an elements of first array: "); + int n = Integer.parseInt(read.readLine()); + int [] firstArray = new int [n]; + + for (int i = 0; i < firstArray.length; i++) { + firstArray[i]= (int) (Math.random()*100)-50; + System.out.print(firstArray[i] + ", "); + } + + System.out.println("\n\nEnter quantity an elements of second array: "); + int m = Integer.parseInt(read.readLine()); + int [] secondArray = new int [m]; + + for (int i = 0; i < secondArray.length; i++) { + secondArray[i]= (int) (Math.random()*100)-50; + System.out.print(secondArray[i] + ", "); + } + + System.out.println("\n\nChoose number from first array: "); + int k = Integer.parseInt(read.readLine()); + + System.out.println("\n\nResult of joining two arrays : "); + for (int i = 0; i < firstArray.length; i++) { + System.out.print(firstArray[i] + ", "); + if (k == firstArray[i]) { + for (int j = 0; j < secondArray.length; j++) { + System.out.print(secondArray[j] + ", "); + } + } + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} \ No newline at end of file From 17462ad0b53ba8ddbcd11a33deda20a6d55c2a07 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Sun, 25 Aug 2019 21:05:04 +0300 Subject: [PATCH 45/70] second commit for Task_29 --- Task29/src/main/java/Task_29.java | 9 ++++++++- 1 file changed, 8 insertions(+), 1 deletion(-) diff --git a/Task29/src/main/java/Task_29.java b/Task29/src/main/java/Task_29.java index 9ff7ac3..ba3085e 100644 --- a/Task29/src/main/java/Task_29.java +++ b/Task29/src/main/java/Task_29.java @@ -19,7 +19,7 @@ public class Task_29 { public static void main(String[] args) { try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { - System.out.println("Enter quantity the elements of first sequence: "); + System.out.println("Enter quantity the elements of sequence: "); int n = Integer.parseInt(read.readLine()); int[] array = new int[n + 1]; for (int i = 1; i < array.length; i++) { @@ -50,3 +50,10 @@ public static void main(String[] args) { } } } +/* + Example of output: + Enter quantity the elements of sequence: + 5 + 3, 6, 9, 12, 15, + 15, 12, 9, 6, 3, + */ \ No newline at end of file From 842ae67265c7153e7133b453da47f7018cd48ef7 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Tue, 27 Aug 2019 00:04:39 +0300 Subject: [PATCH 46/70] first commit for Task_30 --- .gitignore | 44 +++++++++++++++++++-- Task30/src/main/java/BinarySearch.java | 45 ++++++++++++++++++++++ Task30/src/main/java/Task_30.java | 48 +++++++++++++++++++++++ Task30/src/main/java/Task_31.java | 53 -------------------------- 4 files changed, 134 insertions(+), 56 deletions(-) create mode 100644 Task30/src/main/java/BinarySearch.java create mode 100644 Task30/src/main/java/Task_30.java delete mode 100644 Task30/src/main/java/Task_31.java diff --git a/.gitignore b/.gitignore index b7ee812..87b8dd8 100644 --- a/.gitignore +++ b/.gitignore @@ -1,4 +1,42 @@ +.DS_Store +*.swp +index.data +*~ +html/*.html +html/css/style.css +html/css/style.css.map +html/perl6.xhtml +html/routine/ +html/type/ +html/op/ +html/language/ +html/programs/ +html/syntax/ +html/images/type-graph* +html/js/search.js +.precomp +precompiled +assets/assetpack.db +assets/cache +.sass-cache/ +html/css/style.css.map +html/links.txt +xt/aspell.pws +highlights/node_modules +**/npm-debug.log +highlights/atom-language-perl6/ +.DS_store +highlights/package-lock.json + +# IDE specific +.scala_dependencies +.classpath +*.iml .idea/ -target/ -*.iml/ -pom.xml/ \ No newline at end of file +.idea_modules/ +.project +.settings/ +*.sublime-project +*.sublime-workspace +/.env +atlassian-ide-plugin.xml \ No newline at end of file diff --git a/Task30/src/main/java/BinarySearch.java b/Task30/src/main/java/BinarySearch.java new file mode 100644 index 0000000..b3b323e --- /dev/null +++ b/Task30/src/main/java/BinarySearch.java @@ -0,0 +1,45 @@ +public class BinarySearch { + + // has to return boxed integer in order to comfort to interface defined in the book + // Sorted only + private static Integer binarySearch(int[] list, int item) { + int low = 0; + int high = list.length - 1; + + while (low <= high) { + int mid = (low + high) / 2; + int guess = list[mid]; + if (guess == item) { + return mid; + } + if (guess > item) { + high = mid - 1; + } else { + low = mid + 1; + } + } + + return null; + } + + public static void main(String[] args) { + int[] myList = {1, 3, 5, 7, 9}; + + System.out.println(binarySearch(myList, -2)); // index null index + System.out.println(binarySearch(myList, -1)); //index null + System.out.println(binarySearch(myList, 0)); //index null + System.out.println(binarySearch(myList, 1)); //index 0 + System.out.println(binarySearch(myList, 2)); //index null + System.out.println(binarySearch(myList, 3)); //index 1 + System.out.println(binarySearch(myList, 4)); //index null + System.out.println(binarySearch(myList, 5)); //index 2 + System.out.println(binarySearch(myList, 6)); //index null + System.out.println(binarySearch(myList, 7));//index 3 + System.out.println(binarySearch(myList, 8));//index null + System.out.println(binarySearch(myList, 9));//index 4 + System.out.println(binarySearch(myList, 10));//index null + System.out.println(binarySearch(myList, 11));//index null + System.out.println(binarySearch(myList, 12));//index null + System.out.println(binarySearch(myList, 13));//index null + } +} \ No newline at end of file diff --git a/Task30/src/main/java/Task_30.java b/Task30/src/main/java/Task_30.java new file mode 100644 index 0000000..9f5272f --- /dev/null +++ b/Task30/src/main/java/Task_30.java @@ -0,0 +1,48 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + ENG: + Sort exchanges. Given a sequence of numbers a1 <= a2 <= <= aN. It is required to rearrange the numbers in +         ascending order. For this, two neighboring numbers a i and a i + 1 are compared. If a i> a i + 1, then +         rearrangement. This continues until all the elements are arranged in ascending order. +         Create a sorting algorithm, while counting the number of permutations. + + RUS: + Сортировка обменами. Дана последовательность чисел a1<=a2<= <=aN .Требуется переставить числа в + порядке возрастания. Для этого сравниваются два соседних числа a i и a i + 1 . Если a i > a i + 1 , то делается + перестановка. Так продолжается до тех пор, пока все элементы не станут расположены в порядке возрастания. + Составить алгоритм сортировки, подсчитывая при этом количества перестановок. + */ + +public class Task_30 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quantity an elements of array: "); + int n = Integer.parseInt(read.readLine()); + int[] array = new int[n]; + + for (int i = 0; i < array.length; i++) { + array[i] = (int) (Math.random() * 100) - 50; + System.out.print(array[i] + ", "); + } + System.out.println("\n\n Bubble sort : "); + int swap; + for (int i = 0; i < array.length; i++) { + for (int j = 0; j < i; j++) { + + if (array[i] < array[j]) { + swap = array[i]; + array[i] = array[j]; + array[j] = swap; + } + } + } + for (int value : array) { + System.out.print(value + ", "); + } + } catch (IOException e) { + e.printStackTrace(); + } + } +} diff --git a/Task30/src/main/java/Task_31.java b/Task30/src/main/java/Task_31.java deleted file mode 100644 index a8d60be..0000000 --- a/Task30/src/main/java/Task_31.java +++ /dev/null @@ -1,53 +0,0 @@ -import java.io.BufferedReader; -import java.io.IOException; -import java.io.InputStreamReader; -/* - ENG: - Given two one-dimensional arrays with a different number of elements and a natural number k. Combine them into -        one array, including the second array between the kth and (k + 1) - m elements of the first, without using -        additional array. - - RUS: - 3.1 Заданы два одномерных массива с различным количеством элементов и натуральное число k. Объединить их в - один массив, включив второй массив между k-м и (k+1) - м элементами первого, при этом не используя - дополнительный массив. -*/ -public class Task_31 { - public static void main(String[] args) { - try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { - - System.out.println("Enter quantity an elements of first array: "); - int n = Integer.parseInt(read.readLine()); - int [] firstArray = new int [n]; - - for (int i = 0; i < firstArray.length; i++) { - firstArray[i]= (int) (Math.random()*100)-50; - System.out.print(firstArray[i] + ", "); - } - - System.out.println("\n\nEnter quantity an elements of second array: "); - int m = Integer.parseInt(read.readLine()); - int [] secondArray = new int [m]; - - for (int i = 0; i < secondArray.length; i++) { - secondArray[i]= (int) (Math.random()*100)-50; - System.out.print(secondArray[i] + ", "); - } - - System.out.println("\n\nChoose number from first array: "); - int k = Integer.parseInt(read.readLine()); - - System.out.println("\n\nResult of joining two arrays : "); - for (int i = 0; i < firstArray.length; i++) { - System.out.print(firstArray[i] + ", "); - if (k == firstArray[i]) { - for (int j = 0; j < secondArray.length; j++) { - System.out.print(secondArray[j] + ", "); - } - } - } - } catch (IOException e) { - e.printStackTrace(); - } - } -} \ No newline at end of file From 4373256eed075275e9e638fc68126886339b68ce Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Tue, 27 Aug 2019 20:38:28 +0300 Subject: [PATCH 47/70] first commit for Task_31 --- Task31/pom.xml | 24 +++++++++ Task31/src/main/java/Task_31.java | 81 +++++++++++++++++++++++++++++++ 2 files changed, 105 insertions(+) create mode 100644 Task31/pom.xml create mode 100644 Task31/src/main/java/Task_31.java diff --git a/Task31/pom.xml b/Task31/pom.xml new file mode 100644 index 0000000..7ae2d00 --- /dev/null +++ b/Task31/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#31 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task31/src/main/java/Task_31.java b/Task31/src/main/java/Task_31.java new file mode 100644 index 0000000..70f2105 --- /dev/null +++ b/Task31/src/main/java/Task_31.java @@ -0,0 +1,81 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + + /* + Eng: + Sort by inserts. A sequence of numbers a1, a2, a3, a4 ... aN is given. + You need to rearrange the numbers in ascending order. This is done as follows. + Let a1, a2, a3 .. aN be an ordered sequence, i.e. a1 <= a2 <= ... <= aN. The next number ai + 1 is taken and inserted into the sequence so that the new + the sequence was also increasing. The process is performed until all elements from i + 1 to n are enumerated. + Note. Place the next element in the sorted part + using binary search. Binary search is issued as a separate function. + + Rus: + Сортировка вставками. Дана последовательность чисел a1,a2,a3,a4...aN. + Требуется переставить числа в порядке возрастания. Делается это следующим образом. + Пусть a1, a2, a3 .. aN упорядоченная последовательность, т.е. a1<=a2<=...<=aN. + Берется следующее число ai+1 и вставляется в последовательность так, чтобы новая + последовательность была тоже возрастающей. + Процесс производится до тех пор, пока все элементы от i+1 до n не будут перебраны. + Примечание. Место помещения очередного элемента в отсортированную часть производить + с помощью двоичного поиска. Двоичный поиск оформить в виде отдельной функции. + */ + +public class Task_31 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + + System.out.println("Enter quantity of the sequence. "); + int n = Integer.parseInt(read.readLine()); + int[] array = new int[n]; + + for (int i = 0; i < array.length; i++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + array[i] = (int) (Math.random() * 100) * positiveNegative; + System.out.print(array[i] + ", "); + } + + sortingByInsert(array); + + System.out.println("\nAfter sorting: "); + for (int value : array) { + System.out.print(value + ", "); + } + } catch (IOException e) { + e.printStackTrace(); + } + } + + private static void sortingByInsert(int[] array) { + int temp; + for (int i = 1; i < array.length - 1; i++) { + if (array[i] > array[i + 1]) { + temp = array[i + 1]; + int j = binarySearch(array, i, array[i + 1]); + for (int k = i + 1; k > j; k--) { + array[k] = array[k - 1]; + } + array[j] = temp; + } + } + } + + private static int binarySearch(int[] array, int lastIndex, int element) { + int j = lastIndex; + int firstIndex = 0; + while (firstIndex <= lastIndex) { + j = (firstIndex + lastIndex) / 2; + if (array[j] == element) { + return j; + } else if (array[j] < element) { + firstIndex = j + 1; + } else if (array[j] > element && j != 0 && !(array[j - 1] < element)) { + lastIndex = j - 1; + } else { + break; + } + } + return j; + } +} From 2f9ad8e9b30a78e02b465ce243cf3307f6af4a7d Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Tue, 27 Aug 2019 20:51:23 +0300 Subject: [PATCH 48/70] first commit for Task_32 --- Task32/pom.xml | 24 ++++++++++++ Task32/src/main/java/Task_32.java | 62 +++++++++++++++++++++++++++++++ 2 files changed, 86 insertions(+) create mode 100644 Task32/pom.xml create mode 100644 Task32/src/main/java/Task_32.java diff --git a/Task32/pom.xml b/Task32/pom.xml new file mode 100644 index 0000000..9e1c4fe --- /dev/null +++ b/Task32/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#32 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task32/src/main/java/Task_32.java b/Task32/src/main/java/Task_32.java new file mode 100644 index 0000000..7894058 --- /dev/null +++ b/Task32/src/main/java/Task_32.java @@ -0,0 +1,62 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + * Сортировка Шелла. Дан массив n действительных чисел. Требуется упорядочить + * его по возрастанию. Делается это следующим образом: сравниваются два сосед- + * них элемента ai и a(i + 1). Если ai <= a(i + 1), то продвигаются на один + * элемент вперед. Если ai > a(i + 1), то производится перестановка и сдвигаю- + * тся на один элемент назад. Составить алгоритм этой сортировки. + */ + public class Task_32 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + + System.out.println("Enter quantity of the sequence. "); + int n = Integer.parseInt(read.readLine()); + int[] array = new int[n]; + + for (int i = 0; i < array.length; i++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + array[i] = (int) (Math.random() * 100) * positiveNegative; + System.out.print(array[i] + ", "); + } + + System.out.println("\nResult after sorting: "); + sortingShell(array); + + } catch (IOException e) { + e.printStackTrace(); + } + } + private static void sortingShell(int[] array){ + int temp; + int i = 1; + while (i < array.length) { + if (array[i - 1] > array[i]) { + temp = array[i - 1]; + array[i - 1] = array[i]; + array[i] = temp; + if (i - 1 > 0) { + i--; + } + } else { + i++; + } + } + for (int value : array) { + System.out.print(value + ", "); + } + } + } + + /* + Example of output: + + Enter quantity of the sequence. + 7 + -57, 50, -52, -7, -4, -91, 85, + Result after sorting: + -91, -57, -52, -7, -4, 50, 85, + + */ \ No newline at end of file From 5ead576962335af68546ddc45ff9963abe63fcfc Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Tue, 27 Aug 2019 21:07:07 +0300 Subject: [PATCH 49/70] first commit for Task_33 --- Task_33/pom.xml | 24 ++++++++ Task_33/src/main/java/Task_33.java | 91 ++++++++++++++++++++++++++++++ 2 files changed, 115 insertions(+) create mode 100644 Task_33/pom.xml create mode 100644 Task_33/src/main/java/Task_33.java diff --git a/Task_33/pom.xml b/Task_33/pom.xml new file mode 100644 index 0000000..9777b11 --- /dev/null +++ b/Task_33/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task_33 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task_33/src/main/java/Task_33.java b/Task_33/src/main/java/Task_33.java new file mode 100644 index 0000000..3cbc875 --- /dev/null +++ b/Task_33/src/main/java/Task_33.java @@ -0,0 +1,91 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* + * Пусть даны две неубывающие последовательности действительных чисел + * a1 <= a2 <= ... <= an и b1 <= b2 <= ... <= bm. Требуется указать те места, на + * которые нужно вставлять элементы последовательности b1 <= b2 <= ... <= bm в + * первую последовательность так, чтобы новая последовательность оставалась + * возрастающей. + */ + +public class Task_33 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + + System.out.println("Enter quantity of the first sequence. "); + int n = Integer.parseInt(read.readLine()); + int[] firstArray = new int[n]; + + for (int i = 0; i < firstArray.length; i++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + firstArray[i] = (int) (Math.random() * 100) * positiveNegative; + System.out.print(firstArray[i] + ", "); + } + + System.out.println("\nEnter quantity of the second sequence. "); + int m = Integer.parseInt(read.readLine()); + int[] secondArray = new int[m]; + + for (int i = 0; i < secondArray.length; i++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + secondArray[i] = (int) (Math.random() * 100) * positiveNegative; + System.out.print(secondArray[i] + ", "); + } + + int[] newArray = firstArray; + + System.out.println("\nResult after sorting: "); + for (int element : secondArray) { + int pointInsert = insert(newArray, element); + int[] arrayTemp = new int[newArray.length + 1]; + for (int i = 0; i < newArray.length; i++) { + if (pointInsert > i) { + arrayTemp[i] = newArray[i]; + } else if (pointInsert == i) { + arrayTemp[i] = element; + arrayTemp[i + 1] = newArray[i]; + } else { + arrayTemp[i + 1] = newArray[i]; + } + } + newArray = arrayTemp; + System.out.printf("%n%nPosition of insert of new array \"%d\": i = %d", element, pointInsert); + System.out.println("\n\n New sequence after sorting : "); + + printArray(newArray); + } + + + } catch (IOException e) { + e.printStackTrace(); + } + } + + private static int insert(int[] array, int element) { + int j = 0; + int firstIndex = 0; + int lastIndex = array.length - 1; + + while (firstIndex <= lastIndex) { + j = (firstIndex + lastIndex) / 2; + if (array[j] == element) { + return j; + } else if (array[j] < element) { + firstIndex = j + 1; + } else if (array[j] > element && j != 0 && !(array[j - 1] < element)) { + lastIndex = j - 1; + } else { + break; + } + } + return j; + } + + private static void printArray(int[] a) { + for (int element : a) { + System.out.printf("%d ", element); + } + } +} \ No newline at end of file From c6724fb1bdd9b679552825954b2a048a7d2d796e Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Tue, 27 Aug 2019 21:26:03 +0300 Subject: [PATCH 50/70] first commit for Task_34 --- {Task_33 => Task33}/pom.xml | 0 .../src/main/java/Task_33.java | 0 Task34/pom.xml | 24 +++++++ Task34/src/main/java/Task_34.java | 71 +++++++++++++++++++ 4 files changed, 95 insertions(+) rename {Task_33 => Task33}/pom.xml (100%) rename {Task_33 => Task33}/src/main/java/Task_33.java (100%) create mode 100644 Task34/pom.xml create mode 100644 Task34/src/main/java/Task_34.java diff --git a/Task_33/pom.xml b/Task33/pom.xml similarity index 100% rename from Task_33/pom.xml rename to Task33/pom.xml diff --git a/Task_33/src/main/java/Task_33.java b/Task33/src/main/java/Task_33.java similarity index 100% rename from Task_33/src/main/java/Task_33.java rename to Task33/src/main/java/Task_33.java diff --git a/Task34/pom.xml b/Task34/pom.xml new file mode 100644 index 0000000..d3e940f --- /dev/null +++ b/Task34/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#34 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task34/src/main/java/Task_34.java b/Task34/src/main/java/Task_34.java new file mode 100644 index 0000000..209ce9e --- /dev/null +++ b/Task34/src/main/java/Task_34.java @@ -0,0 +1,71 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* + Даны дроби p1/q1, p2/q2, ..., pn/qn (pi, qi - натуральнае). Составить программу, + которая приводит эти дроби к общему знаменателю и упорядочивает их в порядке возрастания. + */ + +public class Task_34 { + public static void main(String[] args) { + Fraction [] array = {new Fraction(1, 3), new Fraction(2, 4), + new Fraction(7, 12), new Fraction(5, 12), + new Fraction(12, 3), new Fraction(17, 24), + new Fraction(5, 6), new Fraction(13, 3)}; + + setCommonDenominator(array); + sortFractionArray(array); + for (Fraction element : array) { + System.out.print(element + ", "); + } + System.out.print("\b\b"); + } + + private static void setCommonDenominator (Fraction [] array) { + boolean isCommon = false; + int commonDenominator = 0; + while (!isCommon) { + isCommon = true; + commonDenominator++; + for (Fraction element : array) { + if (commonDenominator % element.denom != 0) { + isCommon = false; + break; + } + } + } + + for (Fraction element : array) { + element.numer *= (double) commonDenominator / element.denom; + element.denom = commonDenominator; + } + } + + private static void sortFractionArray (Fraction [] array) { + for (int i = array.length - 1; i > 0 ; i--) { + for (int j = 0; j < i; j++) { + if (array[j].numer > array[j + 1].numer) { + Fraction temp = array[j]; + array[j] = array[j + 1]; + array[j + 1] = temp; + } + } + } + } + + static class Fraction { + int numer; + int denom; + Fraction(int numer, int denom) { + this.numer = numer; + this.denom = denom; + } + + @Override + public String toString() { + return String.format("%d/%d", numer, denom); + } + } + +} \ No newline at end of file From f5eeb179a98bb8c45ab3875edcf5af1a554db4a3 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Tue, 27 Aug 2019 21:47:57 +0300 Subject: [PATCH 51/70] first commit for Task_35 --- Task35/pom.xml | 12 ++++++++ Task35/src/main/java/Task_35.java | 49 +++++++++++++++++++++++++++++++ 2 files changed, 61 insertions(+) create mode 100644 Task35/pom.xml create mode 100644 Task35/src/main/java/Task_35.java diff --git a/Task35/pom.xml b/Task35/pom.xml new file mode 100644 index 0000000..b7308af --- /dev/null +++ b/Task35/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#35 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task35/src/main/java/Task_35.java b/Task35/src/main/java/Task_35.java new file mode 100644 index 0000000..d18d297 --- /dev/null +++ b/Task35/src/main/java/Task_35.java @@ -0,0 +1,49 @@ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + * Написать метод(методы) для нахождения наибольшего общего делителя и + * наименьшего общего кратного двух натуральных чисел: + * НОК(А,В) = A*B / НОД(A,B) + */ +public class Task_35 { + + public static void main(String[] args) throws IOException { + int a, b; + int gcd, lcm; + + BufferedReader rd = new BufferedReader(new InputStreamReader(System.in)); + System.out.println("Enter two natural numbers:"); + + a = Integer.parseInt(rd.readLine()); + b = Integer.parseInt(rd.readLine()); + gcd = findGcd(a, b); + System.out.println("Largest Common Factor: " + gcd); + lcm = findLcm(a, b); + System.out.println("Least Common Multiple : " + lcm); + + } + + private static int findGcd(int a, int b) { + a = Math.abs(a); + b = Math.abs(b); + for (int i = 0; i < 2; i++) { + while (a != 0 && b != 0) { + if (a > b) { + a %= b; + } else { + b %= a; + } + } + a += b; + } + return a; + } + + private static int findLcm(int a, int b) { + return Math.abs(a * b / findGcd(a, b)); + } + } + + From a52417d0e6fba9224d96b40bf23891aa09d9bc9e Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Tue, 27 Aug 2019 22:05:17 +0300 Subject: [PATCH 52/70] second commit for Task_35 --- Task35/pom.xml | 12 ++++++++++++ Task35/src/main/java/Task_35.java | 12 +++++++----- 2 files changed, 19 insertions(+), 5 deletions(-) diff --git a/Task35/pom.xml b/Task35/pom.xml index b7308af..c548f49 100644 --- a/Task35/pom.xml +++ b/Task35/pom.xml @@ -7,6 +7,18 @@ io.github.EugeneZakhno Task#35 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + \ No newline at end of file diff --git a/Task35/src/main/java/Task_35.java b/Task35/src/main/java/Task_35.java index d18d297..5f09f66 100644 --- a/Task35/src/main/java/Task_35.java +++ b/Task35/src/main/java/Task_35.java @@ -10,19 +10,21 @@ public class Task_35 { public static void main(String[] args) throws IOException { + int a, b; int gcd, lcm; - BufferedReader rd = new BufferedReader(new InputStreamReader(System.in)); + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { System.out.println("Enter two natural numbers:"); - - a = Integer.parseInt(rd.readLine()); - b = Integer.parseInt(rd.readLine()); + a = Integer.parseInt(read.readLine()); + b = Integer.parseInt(read.readLine()); gcd = findGcd(a, b); System.out.println("Largest Common Factor: " + gcd); lcm = findLcm(a, b); System.out.println("Least Common Multiple : " + lcm); - + } catch (IOException e) { + e.printStackTrace(); + } } private static int findGcd(int a, int b) { From 5c8f2dd493edceaf79ff688f8ddfe540da348769 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Tue, 27 Aug 2019 23:07:13 +0300 Subject: [PATCH 53/70] first commit for Task_36 --- Task35/src/main/java/Task_35.java | 1 - Task36/pom.xml | 24 +++++++++++++++++ Task36/src/main/java/Task_36.java | 45 +++++++++++++++++++++++++++++++ 3 files changed, 69 insertions(+), 1 deletion(-) create mode 100644 Task36/pom.xml create mode 100644 Task36/src/main/java/Task_36.java diff --git a/Task35/src/main/java/Task_35.java b/Task35/src/main/java/Task_35.java index 5f09f66..8e1b567 100644 --- a/Task35/src/main/java/Task_35.java +++ b/Task35/src/main/java/Task_35.java @@ -42,7 +42,6 @@ private static int findGcd(int a, int b) { } return a; } - private static int findLcm(int a, int b) { return Math.abs(a * b / findGcd(a, b)); } diff --git a/Task36/pom.xml b/Task36/pom.xml new file mode 100644 index 0000000..3282f5f --- /dev/null +++ b/Task36/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#36 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task36/src/main/java/Task_36.java b/Task36/src/main/java/Task_36.java new file mode 100644 index 0000000..90840c4 --- /dev/null +++ b/Task36/src/main/java/Task_36.java @@ -0,0 +1,45 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + * Написать метод(методы) для нахождения наибольшего общего делителя четырех + * натуральных чисел. + */ +public class Task_36 { + + public static void main(String[] args) throws IOException { + + int gcd; + System.out.println("Enter natural number:"); + int [] number = fillArray(6); + gcd = findGcd(number); + System.out.println("\nLargest Common Factor: " + gcd); + + } + private static int [] fillArray (int n) throws IOException{ + BufferedReader rd = new BufferedReader(new InputStreamReader(System.in)); + int [] array = new int[n]; + for (int i = 0; i < n; i++) { + System.out.println("Enter number a" + (i + 1) + ":"); + array[i] = Integer.parseInt(rd.readLine()); + } + return array; + } + + private static int findGcd(int [] number) { + int a = Math.abs(number[0]); + for (int element : number) { + int b = Math.abs(element); + while (a != 0 && b != 0) { + if (a > b) { + a %= b; + } else { + b %= a; + } + } + a += b; + } + return a; + } + +} From 17129a45db588ec40693a3359df984c453a2adbd Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Wed, 28 Aug 2019 22:42:36 +0300 Subject: [PATCH 54/70] first commit for Task_37 --- Task37/pom.xml | 24 ++++++++++++++++++++++++ Task37/src/main/java/Task_37.java | 28 ++++++++++++++++++++++++++++ 2 files changed, 52 insertions(+) create mode 100644 Task37/pom.xml create mode 100644 Task37/src/main/java/Task_37.java diff --git a/Task37/pom.xml b/Task37/pom.xml new file mode 100644 index 0000000..e6fd6b4 --- /dev/null +++ b/Task37/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#37 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task37/src/main/java/Task_37.java b/Task37/src/main/java/Task_37.java new file mode 100644 index 0000000..9991df3 --- /dev/null +++ b/Task37/src/main/java/Task_37.java @@ -0,0 +1,28 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* Eng: + Calculate the area of a regular hexagon with side (a) + using the method of calculating the area of a triangle. + + Rus: + Вычислить площадь правильного шестиугольника со стороной а, + используя метод вычисления площади треугольника. +*/ + +class Task_37 { + public static void main(String[] args) { + try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter the side of hexagon: "); + double a = Double.parseDouble(reader.readLine()); + System.out.println("The area of hexagon: "); + System.out.printf("%.1f", squareCounter(a)); + } catch (IOException e) { + e.printStackTrace(); + } + } + private static double squareCounter(double a) { + return (3 * Math.sqrt(3) * Math.pow(a, 2)) / 2; + } +} \ No newline at end of file From 3f46f7993aabc6a4f27388b873f52fbd31954d87 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Wed, 28 Aug 2019 22:44:58 +0300 Subject: [PATCH 55/70] first commit for Task_38 --- Task38/pom.xml | 24 ++++++++++++ Task38/src/main/java/Task_38.java | 62 +++++++++++++++++++++++++++++++ 2 files changed, 86 insertions(+) create mode 100644 Task38/pom.xml create mode 100644 Task38/src/main/java/Task_38.java diff --git a/Task38/pom.xml b/Task38/pom.xml new file mode 100644 index 0000000..1dceb53 --- /dev/null +++ b/Task38/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.eugenezakhno + Task#38 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task38/src/main/java/Task_38.java b/Task38/src/main/java/Task_38.java new file mode 100644 index 0000000..aabe350 --- /dev/null +++ b/Task38/src/main/java/Task_38.java @@ -0,0 +1,62 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + Eng: + On the plane, n matrix are given by their coordinates. + Write a method (s) defining between which of the pairs of matrix + the greatest distance. Indication Coordinates of matrix to put in an array. + + Rus: + На плоскости заданы своими координатами n точек. + Написать метод(методы), определяющие, между какими из пар точек + самое большое расстояние. Указание. Координаты точек занести в массив. +*/ +class Task_38 { + private static double maxDistance; + + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quality of strings"); + int n = Integer.parseInt(read.readLine()); + System.out.println("Enter quality of columns"); + int m = Integer.parseInt(read.readLine()); + int[][] matrix = new int[n][m]; + for (int i = 0; i < matrix.length; i++) { + for (int j = 0; j < matrix[i].length; j++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + matrix[i][j] = (int) (Math.random() * 100) * positiveNegative; + System.out.printf("%3d ", matrix[i][j]); + } + System.out.println(); + } + int [] result = findMaximumDistance(matrix); + System.out.printf("Maximum distance between of points is %d and %d, that equals %.2f %n", + result[0], result[1], maxDistance); + } catch (IOException e) { + e.printStackTrace(); + } + } + private static double distanceCounter (int [][] matrix) { + return Math.sqrt(Math.pow((matrix[0][0] - matrix[1][0]), 2) + + Math.pow((matrix[0][1] - matrix[1][1]), 2)); + } + private static int [] findMaximumDistance (int [][] matrix) { + int [] result = new int[2]; + double distance; + maxDistance = 0; + for (int i = 0; i < matrix.length - 1; i++) { + for (int j = i + 1; j < matrix.length; j++) { + int [][] currentPoints = {{matrix[i][0], matrix[i][1]}, + {matrix[j][0], matrix[j][1]}}; + distance = distanceCounter(currentPoints); + if (distance > maxDistance) { + maxDistance = distance; + result[0] = i + 1; + result[1] = j + 1; + } + } + } + return result; + } +} From 6bfd70715e179e858aa949c25aad5481671914a2 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Wed, 28 Aug 2019 23:17:00 +0300 Subject: [PATCH 56/70] first commit for Task_39 --- Task39/pom.xml | 23 +++++++++++++ Task39/src/main/java/Task_39.java | 55 +++++++++++++++++++++++++++++++ 2 files changed, 78 insertions(+) create mode 100644 Task39/pom.xml create mode 100644 Task39/src/main/java/Task_39.java diff --git a/Task39/pom.xml b/Task39/pom.xml new file mode 100644 index 0000000..1432855 --- /dev/null +++ b/Task39/pom.xml @@ -0,0 +1,23 @@ + + + 4.0.0 + io.github.EugeneZakhno + Task#39 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task39/src/main/java/Task_39.java b/Task39/src/main/java/Task_39.java new file mode 100644 index 0000000..80f432b --- /dev/null +++ b/Task39/src/main/java/Task_39.java @@ -0,0 +1,55 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + ENG: + Create a program that finds the second largest number in the array A [N] (print a number, +       which is less than the maximum element of the array, but larger than all other elements). + + RUS: + Составить программу, которая в массиве A[N] находит второе по величине число (вывести на печать число, + которое меньше максимального элемента массива, но больше всех других элементов). +*/ +public class Task_39 { + public static void main(String[] args) { + + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter the size numbers:"); + int n = Integer.parseInt(read.readLine()); + int [] array = new int [n]; + for (int i=0; i Date: Wed, 28 Aug 2019 23:19:32 +0300 Subject: [PATCH 57/70] second commit for Task_39 --- {Task30 => Task31}/src/main/java/BinarySearch.java | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename {Task30 => Task31}/src/main/java/BinarySearch.java (100%) diff --git a/Task30/src/main/java/BinarySearch.java b/Task31/src/main/java/BinarySearch.java similarity index 100% rename from Task30/src/main/java/BinarySearch.java rename to Task31/src/main/java/BinarySearch.java From e7d5438e4084997d04a11b9ad337f134beadda8c Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Wed, 28 Aug 2019 23:46:35 +0300 Subject: [PATCH 58/70] second commit for Task_40 --- Task40/pom.xml | 21 +++++++++++++ Task40/src/main/java/Task_40.java | 52 +++++++++++++++++++++++++++++++ 2 files changed, 73 insertions(+) create mode 100644 Task40/pom.xml create mode 100644 Task40/src/main/java/Task_40.java diff --git a/Task40/pom.xml b/Task40/pom.xml new file mode 100644 index 0000000..46b7757 --- /dev/null +++ b/Task40/pom.xml @@ -0,0 +1,21 @@ + + + 4.0.0 + io.github.EugeneZakhno + Task#40 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + \ No newline at end of file diff --git a/Task40/src/main/java/Task_40.java b/Task40/src/main/java/Task_40.java new file mode 100644 index 0000000..4565256 --- /dev/null +++ b/Task40/src/main/java/Task_40.java @@ -0,0 +1,52 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + ENG: + Write a method (s) to check if the given three numbers are coprime.). + + RUS: + Написать метод(методы), проверяющий, являются ли данные три числа взаимно простыми. +*/ +public class Task_40 { + public static void main(String[] args) { + + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter first number:" ); + int a = Integer.parseInt(read.readLine()); + + System.out.println("Enter second number: "); + int b = Integer.parseInt(read.readLine()); + + System.out.println("Enter third number: "); + int c = Integer.parseInt(read.readLine()); + + int [] number = {a, b, c}; + System.out.println("What number is mutually number prime? "); + System.out.println(isMutually(number)); + + } catch (IOException e) { + e.printStackTrace(); + } + } + + private static int findGcd(int [] number) { + int a = Math.abs(number[0]); + for (int element : number) { + int b = Math.abs(element); + while (a != 0 && b != 0) { + if (a > b) { + a %= b; + } else { + b %= a; + } + } + a += b; + } + return a; + } + + private static boolean isMutually (int[] a) { + return findGcd(a) == 1; + } +} \ No newline at end of file From 7afbc8a564c3eb939f9d4f0aa7cc96a16f1c5c7b Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Wed, 28 Aug 2019 23:59:42 +0300 Subject: [PATCH 59/70] second commit for Task_41 --- Task41/pom.xml | 23 +++++++++++++++++++++++ Task41/src/main/java/Task_41.java | 28 ++++++++++++++++++++++++++++ 2 files changed, 51 insertions(+) create mode 100644 Task41/pom.xml create mode 100644 Task41/src/main/java/Task_41.java diff --git a/Task41/pom.xml b/Task41/pom.xml new file mode 100644 index 0000000..e8d4e9f --- /dev/null +++ b/Task41/pom.xml @@ -0,0 +1,23 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#41 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + \ No newline at end of file diff --git a/Task41/src/main/java/Task_41.java b/Task41/src/main/java/Task_41.java new file mode 100644 index 0000000..249c128 --- /dev/null +++ b/Task41/src/main/java/Task_41.java @@ -0,0 +1,28 @@ +/* + ENG: + Write a method (s) for calculating the sum of the factorials of all odd numbers from 1 to 9. + RUS: + Написать метод(методы) для вычисления суммы факториалов всех нечетных чисел от 1 до 9. +*/ +public class Task_41 { + public static void main(String[] args) { + int [] array = {1, 3, 5, 7, 9}; + System.out.println(amountFactorial(array)); + } + + private static int amountFactorial (int [] array) { + int amount = 0; + for (int element : array) { + amount += factorial(element); + } + return amount; + } + private static int factorial (int n) { + int result = 1; + if (n == 1 || n == 0) { + return result; + } + result = n * factorial(n - 1); + return result; + } +} \ No newline at end of file From 4ddaa143358b6fed1629a2373f53be20234df9ca Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 29 Aug 2019 19:55:01 +0300 Subject: [PATCH 60/70] second commit for Task_42 --- Task42/pom.xml | 24 +++++++++++++++++ Task42/src/main/java/Task_42.java | 45 +++++++++++++++++++++++++++++++ 2 files changed, 69 insertions(+) create mode 100644 Task42/pom.xml create mode 100644 Task42/src/main/java/Task_42.java diff --git a/Task42/pom.xml b/Task42/pom.xml new file mode 100644 index 0000000..41b76cf --- /dev/null +++ b/Task42/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#42 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task42/src/main/java/Task_42.java b/Task42/src/main/java/Task_42.java new file mode 100644 index 0000000..6810221 --- /dev/null +++ b/Task42/src/main/java/Task_42.java @@ -0,0 +1,45 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +/* Eng: + An array D is specified. Define the following sums: D [l] + D [2] + D [3]; D [3] + D [4] + D [5]; D [4] + D [5] + D [6]. + Explanation. Create a method (methods) for calculating the sum of three consecutive elements + array with numbers from k to m. + + Rus: + Задан массив D. Определить следующие суммы: D[l] + D[2] + D[3]; D[3] + D[4] + D[5]; D[4] +D[5] +D[6]. + Пояснение. Составить метод(методы) для вычисления суммы трех последовательно расположенных элементов + массива с номерами от k до m. +*/ +class Task_42 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter quantity of the array more then 6 elements: "); + int m = Integer.parseInt(read.readLine()); + int[] array = new int[m]; + if (m >= 6) { + for (int i = 0; i < array.length; i++) { + int positiveNegative = Math.random() < 0.5 ? -1 : 1; + array[i] = (int) (Math.random() * 100) * positiveNegative; + System.out.print(array[i] + ", "); + } + System.out.println("\nResult after calculating: "); + calculate(array, 1); + calculate(array, 3); + calculate(array, 4); + } else { + System.out.println("You entered less then 6 elements: "); + } + } catch (IOException e) { + e.printStackTrace(); + } + } + private static void calculate(int[] array, int k) { + int sum = 0; + for (int i = k - 1; i < k + 2; i++) { + sum += array[i]; + } + System.out.println(sum); + } +} \ No newline at end of file From 7288dd52980a63a79f7d7bb791bec7f81d967405 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 29 Aug 2019 19:57:16 +0300 Subject: [PATCH 61/70] first commit for Task_43 --- Task43/pom.xml | 24 ++++++++++++++++++ Task43/src/main/java/Task_43.java | 41 +++++++++++++++++++++++++++++++ 2 files changed, 65 insertions(+) create mode 100644 Task43/pom.xml create mode 100644 Task43/src/main/java/Task_43.java diff --git a/Task43/pom.xml b/Task43/pom.xml new file mode 100644 index 0000000..7172b71 --- /dev/null +++ b/Task43/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#43 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task43/src/main/java/Task_43.java b/Task43/src/main/java/Task_43.java new file mode 100644 index 0000000..263d3d7 --- /dev/null +++ b/Task43/src/main/java/Task_43.java @@ -0,0 +1,41 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + Eng: + Given the numbers X, Y, Z, T - the lengths of the sides of the quadrangle. Write a method (s) + computing its area if the angle between the sides of length X and Y is a straight line. + + Rus: + Даны числа X, Y, Z, Т — длины сторон четырехугольника. Написать метод(методы) + вычисления его площади, если угол между сторонами длиной X и Y— прямой. +*/ +class Task_43 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter the sizes of sides quadrangle: "); + System.out.println("x = "); + int x = Integer.parseInt(read.readLine()); + System.out.println("y = "); + int y = Integer.parseInt(read.readLine()); + System.out.println("z = "); + int z = Integer.parseInt(read.readLine()); + System.out.println("t = "); + int t = Integer.parseInt(read.readLine()); + + System.out.println("The area of quadrangle is: "); + double quadrilateral = (float) calculateSquare(x, y, z, t); + System.out.println(quadrilateral); + } catch (IOException ex) { + ex.printStackTrace(); + } + } + + private static double calculateSquare(double x, double y, double z, double t) { + double diagonal = Math.sqrt(x * x + y * y); + double s1 = x * y / 2; + double p = (diagonal + z + t) / 2; + double s2 = Math.sqrt(p * (p - diagonal) * (p - z) * (p - t)); + return s1 + s2; + } +} \ No newline at end of file From 2eb97dd1f71682eaf564f66bc9210e23dbef3204 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 29 Aug 2019 19:59:13 +0300 Subject: [PATCH 62/70] first commit for Task_44 --- Task44/pom.xml | 24 ++++++++++++++++++++++ Task44/src/main/java/Task_44.java | 34 +++++++++++++++++++++++++++++++ 2 files changed, 58 insertions(+) create mode 100644 Task44/pom.xml create mode 100644 Task44/src/main/java/Task_44.java diff --git a/Task44/pom.xml b/Task44/pom.xml new file mode 100644 index 0000000..1c73d17 --- /dev/null +++ b/Task44/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#44 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task44/src/main/java/Task_44.java b/Task44/src/main/java/Task_44.java new file mode 100644 index 0000000..c2a6ada --- /dev/null +++ b/Task44/src/main/java/Task_44.java @@ -0,0 +1,34 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + Eng: + Given a natural number N. Write a method (methods) to form an array whose elements + are the digits of the number N. + + Rus: + Дано натуральное число N. Написать метод(методы) для формирования массива, + элементами которого являются цифры числа N +*/ +class Task_44 { + private static void creationOfArray (int m, int n) { + int [] array = new int [m]; + for(int i = 0; i < array.length;i++){ + array[i] = n; + System.out.printf("%d, ", array[i]); + } + } + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter the size of array: "); + int m = Integer.parseInt(read.readLine()); + System.out.println("Enter number N: "); + int n = Integer.parseInt(read.readLine()); + + creationOfArray (m, n); + + } catch (IOException ex) { + ex.printStackTrace(); + } + } +} \ No newline at end of file From 7f2fb70e3db9b68b129b54f834d4444708cd512a Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 29 Aug 2019 20:01:50 +0300 Subject: [PATCH 63/70] first commit for Task_45 --- Task45/pom.xml | 24 +++++++++++++++ Task45/src/main/java/Task_45.java | 51 +++++++++++++++++++++++++++++++ 2 files changed, 75 insertions(+) create mode 100644 Task45/pom.xml create mode 100644 Task45/src/main/java/Task_45.java diff --git a/Task45/pom.xml b/Task45/pom.xml new file mode 100644 index 0000000..eed8b87 --- /dev/null +++ b/Task45/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#45 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task45/src/main/java/Task_45.java b/Task45/src/main/java/Task_45.java new file mode 100644 index 0000000..e4d4378 --- /dev/null +++ b/Task45/src/main/java/Task_45.java @@ -0,0 +1,51 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + Eng: + The natural numbers K and N are given. Write a method (methods) of forming the array A, + whose elements are numbers whose sum of digits is equal to K and which are not + greater than N. + + Rus: + Даны натуральные числа К и N. Написать метод(методы) формирования массива А, + элементами которого являются числа, сумма цифр которых равна К и которые не большее N. +*/ +class Task_46 { + + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter the number K: "); + int k = Integer.parseInt(read.readLine()); + System.out.println("Enter the number N: "); + int n = Integer.parseInt(read.readLine()); + + int [] array = createArray(k, n); + + System.out.println("The result is: "); + printArray(array); + + } catch (IOException ex) { + ex.printStackTrace(); + } + } + + private static int [] createArray (int k, int n) { + int [] array = new int[k]; + int i; + for (i = 0; i < array.length && k > n; i++) { + array[i] = (int) (Math.random() * n) + 1; + k -= array[i]; + } + array[i] = k; + int [] arrayA = new int[i + 1]; + System.arraycopy(array, 0, arrayA, 0, i + 1); + return arrayA; + } + + private static void printArray (int [] array) { //вывод массива + for (int element : array) { + System.out.printf("%3d ", element); + } + } +} From 995f67ee9e9c879b66a78f36075778ab637b870c Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 29 Aug 2019 20:07:20 +0300 Subject: [PATCH 64/70] first commit for Task_46 --- Task45/src/main/java/Task_45.java | 53 +++++++++++-------------------- Task46/pom.xml | 24 ++++++++++++++ Task46/src/main/java/Task_46.java | 50 +++++++++++++++++++++++++++++ 3 files changed, 92 insertions(+), 35 deletions(-) create mode 100644 Task46/pom.xml create mode 100644 Task46/src/main/java/Task_46.java diff --git a/Task45/src/main/java/Task_45.java b/Task45/src/main/java/Task_45.java index e4d4378..94eac4e 100644 --- a/Task45/src/main/java/Task_45.java +++ b/Task45/src/main/java/Task_45.java @@ -3,49 +3,32 @@ import java.io.InputStreamReader; /* Eng: - The natural numbers K and N are given. Write a method (methods) of forming the array A, - whose elements are numbers whose sum of digits is equal to K and which are not - greater than N. + Write a method (s) that determines which of the two numbers has more digits. - Rus: - Даны натуральные числа К и N. Написать метод(методы) формирования массива А, - элементами которого являются числа, сумма цифр которых равна К и которые не большее N. + Rus: + Написать метод(методы), определяющий, в каком из данных двух чисел больше цифр. */ -class Task_46 { - +class Task_45 { + private static String moreDigits(int m, int n) { + int firstCount = (int)(Math.log10(Math.abs(m))+1); + int secondCount = (int)(Math.log10(Math.abs(n))+1); + if (firstCount == secondCount) { + return "The quantity of digits is equal"; + } else { + return (firstCount > secondCount) ? ("M consists more") : ("N consists more"); + } + } public static void main(String[] args) { try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { - System.out.println("Enter the number K: "); - int k = Integer.parseInt(read.readLine()); + System.out.println("Enter the number M: "); + int m = Integer.parseInt(read.readLine()); System.out.println("Enter the number N: "); int n = Integer.parseInt(read.readLine()); - - int [] array = createArray(k, n); - - System.out.println("The result is: "); - printArray(array); - + System.out.println("Number that consist more digits: "); + System.out.println(moreDigits(m, n)); } catch (IOException ex) { ex.printStackTrace(); } } - - private static int [] createArray (int k, int n) { - int [] array = new int[k]; - int i; - for (i = 0; i < array.length && k > n; i++) { - array[i] = (int) (Math.random() * n) + 1; - k -= array[i]; - } - array[i] = k; - int [] arrayA = new int[i + 1]; - System.arraycopy(array, 0, arrayA, 0, i + 1); - return arrayA; - } - - private static void printArray (int [] array) { //вывод массива - for (int element : array) { - System.out.printf("%3d ", element); - } - } } + diff --git a/Task46/pom.xml b/Task46/pom.xml new file mode 100644 index 0000000..55a8de9 --- /dev/null +++ b/Task46/pom.xml @@ -0,0 +1,24 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#46 + 1.0-SNAPSHOT + + + + org.apache.maven.plugins + maven-compiler-plugin + + 7 + 7 + + + + + + + \ No newline at end of file diff --git a/Task46/src/main/java/Task_46.java b/Task46/src/main/java/Task_46.java new file mode 100644 index 0000000..11475ed --- /dev/null +++ b/Task46/src/main/java/Task_46.java @@ -0,0 +1,50 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +/* + Eng: + The natural numbers K and N are given. Write a method (methods) of forming the array A, + whose elements are numbers whose sum of digits is equal to K and which are not + greater than N. + + Rus: + Даны натуральные числа К и N. Написать метод(методы) формирования массива А, + элементами которого являются числа, сумма цифр которых равна К и которые не большее N. +*/ +class Task_46 { + public static void main(String[] args) { + try (BufferedReader read = new BufferedReader(new InputStreamReader(System.in))) { + System.out.println("Enter the number K: "); + int k = Integer.parseInt(read.readLine()); + System.out.println("Enter the number N: "); + int n = Integer.parseInt(read.readLine()); + + int [] array = createArray(k, n); + + System.out.println("The result is: "); + printArray(array); + + } catch (IOException ex) { + ex.printStackTrace(); + } + } + + private static int [] createArray (int k, int n) { + int [] array = new int[k]; + int i; + for (i = 0; i < array.length && k > n; i++) { + array[i] = (int) (Math.random() * n) + 1; + k -= array[i]; + } + array[i] = k; + int [] arrayA = new int[i + 1]; + System.arraycopy(array, 0, arrayA, 0, i + 1); + return arrayA; + } + + private static void printArray (int [] array) { //вывод массива + for (int element : array) { + System.out.printf("%3d ", element); + } + } +} \ No newline at end of file From 7c3e32093a28cb492391fa415dd92021d587c7cb Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 29 Aug 2019 20:09:38 +0300 Subject: [PATCH 65/70] first commit for Task_47 --- Task47/pom.xml | 10 ++++++++ Task47/src/main/java/Task_47.java | 41 +++++++++++++++++++++++++++++++ 2 files changed, 51 insertions(+) create mode 100644 Task47/pom.xml create mode 100644 Task47/src/main/java/Task_47.java diff --git a/Task47/pom.xml b/Task47/pom.xml new file mode 100644 index 0000000..84f201a --- /dev/null +++ b/Task47/pom.xml @@ -0,0 +1,10 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#47 + 1.0-SNAPSHOT + \ No newline at end of file diff --git a/Task47/src/main/java/Task_47.java b/Task47/src/main/java/Task_47.java new file mode 100644 index 0000000..8f8f9b8 --- /dev/null +++ b/Task47/src/main/java/Task_47.java @@ -0,0 +1,41 @@ +/* + Eng: + Two primes are called “twins” if they differ from each other + by 2 (e.g. 41 and 43). Find and print all pairs of “twins” from the segment + [n, 2n], where n is a given positive integer greater than 2. To solve the problem + use decomposition. + + Rus: + Два простых числа называются «близнецами», если они отличаются друг от друга + на 2 (например, 41 и 43). Найти и напечатать все пары «близнецов» из отрезка + n,2n], где n - заданное натуральное число больше 2. Для решения задачи + использовать декомпозицию. + */ + +class Task_47 { + + private static int [][] findTwin (int n) { + int [][] twinNumbers = new int[n - 1][2]; + for (int i = 0; i < twinNumbers.length; i++) { + twinNumbers[i][0] = n + i; + twinNumbers[i][1] = twinNumbers[i][0] + 2; + } + return twinNumbers; + } + + private static void printMatrix (int [][] square) { //вывод матрицы + for (int[] array : square) { + for (int element : array) { + System.out.printf("%2d ", element); + } + System.out.println(); + } + } + + public static void main(String[] args) { + int n = 40; + int [][] twinNumbers = findTwin(n); + System.out.printf("Numbers \"Twins\" on the distance from %d till %d:%n", n, n * 2); + printMatrix(twinNumbers); + } +} \ No newline at end of file From e74677798691d4416da8f18b732b88a2691711ec Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 29 Aug 2019 20:12:11 +0300 Subject: [PATCH 66/70] first commit for Task_48 --- Task48/pom.xml | 12 ++++++++ Task48/src/main/java/Task_48.java | 48 +++++++++++++++++++++++++++++++ 2 files changed, 60 insertions(+) create mode 100644 Task48/pom.xml create mode 100644 Task48/src/main/java/Task_48.java diff --git a/Task48/pom.xml b/Task48/pom.xml new file mode 100644 index 0000000..050d509 --- /dev/null +++ b/Task48/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#48 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task48/src/main/java/Task_48.java b/Task48/src/main/java/Task_48.java new file mode 100644 index 0000000..a6d3f6a --- /dev/null +++ b/Task48/src/main/java/Task_48.java @@ -0,0 +1,48 @@ +/* + Eng: + A natural number with n digits in it is called an Armstrong number, + if the sum of its digits raised to the power of n is equal to the number itself. Find all + Armstrong numbers from 1 to k. To solve the problem, use decomposition. + Rus: + Натуральное число, в записи которого n цифр, называется числом Армстронга, + если сумма его цифр, возведенная в степень n, равна самому числу. Найти все + числа Армстронга от 1 до k. Для решения задачи использовать декомпозицию. + */ +class Task_48 { + private static void printArmstrongNumbers(int k) { + for (int i = 1; i <= k; i++) { + if (isArmstrong(i)) { + System.out.print(i + " "); + } + } + } + private static boolean isArmstrong(int number) { + int sum = 0; + + int[] array = new int[lenghtNumber(number)]; + int n = number; + for (int i = array.length; i > 0; i--) { + array[i - 1] = n - (n / 10) * 10; + n /= 10; + } + for (int element : array) { + int inDegree = element; + for (int j = 1; j < array.length; j++) { + inDegree *= element; + } + sum += inDegree; + } + return number == sum; + } + private static int lenghtNumber(int n) { + int length = 0; + while (n >= 1) { + length++; + n /= 10; + } + return length; + } + public static void main(String[] args) { + printArmstrongNumbers(Integer.MAX_VALUE); + } +} \ No newline at end of file From dc1fc7a37f020b34246713d3dde3acf60b0d8a6c Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 29 Aug 2019 20:13:36 +0300 Subject: [PATCH 67/70] first commit for Task_49 --- Task49/pom.xml | 12 ++++++++++ Task49/src/main/java/Task_49.java | 39 +++++++++++++++++++++++++++++++ 2 files changed, 51 insertions(+) create mode 100644 Task49/pom.xml create mode 100644 Task49/src/main/java/Task_49.java diff --git a/Task49/pom.xml b/Task49/pom.xml new file mode 100644 index 0000000..665da83 --- /dev/null +++ b/Task49/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#49 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task49/src/main/java/Task_49.java b/Task49/src/main/java/Task_49.java new file mode 100644 index 0000000..1afcdac --- /dev/null +++ b/Task49/src/main/java/Task_49.java @@ -0,0 +1,39 @@ +/* + Eng: + Find all natural n-digit numbers in which the numbers form a strictly increasing + sequence (for example, 1234, 5789). To solve the problem, use decomposition. + Rus: + Найти все натуральные n-значные числа, цифры в которых образуют строго + возрастающую последовательность (например, 1234, 5789). Для решения задачи + использовать декомпозицию. + */ + +class Task_49 { + private static void findNumbers (int n) { + int [] number = new int[n]; + number[0] = 1; + while (number[n - 1] < 9) { + for (int i = 1; i < number.length; i++) { + number[i] = number[0] + i; + } + for (int element : number) { + System.out.print(element); + } + System.out.print(", "); + number[0]++; + } + System.out.println("\b\b"); + } + + public static void main(String[] args) { + findNumbers(2); + findNumbers(3); + findNumbers(4); + findNumbers(5); + findNumbers(6); + findNumbers(7); + findNumbers(8); + findNumbers(9); + + } +} \ No newline at end of file From 18fbc41e26933cf938ae5ba0a944b953b61f3118 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 29 Aug 2019 20:16:14 +0300 Subject: [PATCH 68/70] first commit for Task_50 --- Task50/pom.xml | 12 ++++++ Task50/src/main/java/Task_50.java | 72 +++++++++++++++++++++++++++++++ 2 files changed, 84 insertions(+) create mode 100644 Task50/pom.xml create mode 100644 Task50/src/main/java/Task_50.java diff --git a/Task50/pom.xml b/Task50/pom.xml new file mode 100644 index 0000000..cb1a241 --- /dev/null +++ b/Task50/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#50 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task50/src/main/java/Task_50.java b/Task50/src/main/java/Task_50.java new file mode 100644 index 0000000..cd4b3a1 --- /dev/null +++ b/Task50/src/main/java/Task_50.java @@ -0,0 +1,72 @@ +/* + Eng: + Write a program that determines the sum of n - digit numbers containing only odd numbers. + Determine also how many even digits in the sum found. To solve the problem, + use decomposition. + + Rus: + Написать программу, определяющую сумму n - значных чисел, содержащих только + нечетные цифры. Определить также, сколько четных цифр в найденной сумме. Для + решения задачи использовать декомпозицию. + */ +class Task_50 { + + private static int calculateSum(int n) { + int[] numbers = findNumbers(n); + int sum = 0; + for (int element : numbers) { + sum += element; + } + return sum; + } + + private static int[] findNumbers(int n) { + int size = (int) Math.pow(5, n); + int[] numbers = new int[size]; + int firstNumber = 1; + for (int i = 1; i < n; i++) { + firstNumber += (int) Math.pow(10, i); + } + numbers[0] = firstNumber; + + for (int i = 1; i < numbers.length; i++) { + numbers[i] = nextNumber(numbers[i - 1], n); + } + return numbers; + } + + private static int nextNumber(int number, int n) { + boolean isNext = false; + while (!isNext) { + number += 2; + isNext = true; + int m = n; + while (m > 0) { + if ((number / ((int) Math.pow(10, m-- - 1))) % 2 == 0) { + isNext = false; + } + } + } + return number; + } + + private static int countEvenNumbers(int n) { + int rest; + int count = 0; + while (n != 0) { + rest = n % 10; + n = n / 10; + if (rest % 2 == 0) + count++; + } + return count; + } + + public static void main(String[] args) { + int n = 6; + int sum = calculateSum(n); + int evenNumbers = countEvenNumbers(sum); + System.out.printf("Sum %d numbers, consists even numbers: %d %n", n, sum); + System.out.printf("In founded sum %d even numbers", evenNumbers); + } +} \ No newline at end of file From cc5fd11e3f14e554fa975f658a798af25deb0ed2 Mon Sep 17 00:00:00 2001 From: EugeneZakhno Date: Thu, 29 Aug 2019 20:18:26 +0300 Subject: [PATCH 69/70] first commit for Task_51 --- Task51/pom.xml | 12 +++++++++++ Task51/src/main/java/Task_51.java | 35 +++++++++++++++++++++++++++++++ 2 files changed, 47 insertions(+) create mode 100644 Task51/pom.xml create mode 100644 Task51/src/main/java/Task_51.java diff --git a/Task51/pom.xml b/Task51/pom.xml new file mode 100644 index 0000000..70418d9 --- /dev/null +++ b/Task51/pom.xml @@ -0,0 +1,12 @@ + + + 4.0.0 + + io.github.EugeneZakhno + Task#51 + 1.0-SNAPSHOT + + + \ No newline at end of file diff --git a/Task51/src/main/java/Task_51.java b/Task51/src/main/java/Task_51.java new file mode 100644 index 0000000..153f98f --- /dev/null +++ b/Task51/src/main/java/Task_51.java @@ -0,0 +1,35 @@ +/* + Eng: + Subtract the sum of its digits from the given number. Subtract the sum of it from the result again. + numbers, etc. How many of these actions must be done to get zero? + To solve the problem, use the decomposition + Rus: + Из заданного числа вычТи сумму его цифр. Из результата вновь вычТи сумму его + цифр и т.д. Сколько таких действий надо произвести, чтобы получился нуль? + Для решения задачи использовать декомпозицию + */ +class Task_51 { + private static int countSubtraction(int number) { + int count = 0; + while (number > 0) { + number -= countSumOfDigits(number); + count++; + } + return count; + } + + private static int countSumOfDigits(int number) { + int sum = 0; + while (number > 0) { + sum += number % 10; + number /= 10; + } + System.out.print(sum + ", "); + return sum; + } + + public static void main(String[] args) { + int n = countSubtraction(331); + System.out.println("\nThe quantity of the substractions: " + n); + } +} \ No newline at end of file From 0b1496a5083097277ab535a68c6716969fe4cbb1 Mon Sep 17 00:00:00 2001 From: EugeneZakhno <30446748+EugeneZakhno@users.noreply.github.com> Date: Thu, 29 Aug 2019 20:23:08 +0300 Subject: [PATCH 70/70] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index fe15c7b..604a4e6 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # 2_Algorithmization Описание файлов: - - [Practice (tasks).pdf](https://drive.google.com/file/d/1EIDMT_GgnzgORfQauELjavOSmMVfpoHK/view) - файл содержит список задач, которые нужно решить для завершения этапа. + - [Practice (tasks).pdf](https://github.com/EugeneZakhno/2_Algorithmization/blob/master/Practice%20(tasks).pdf) - файл содержит список задач, которые нужно решить для завершения этапа. - Questions.pdf - файл содержит вопросы, на которые нужно уметь отвечать по завершению этапа. - Recommendations.pdf - файл содержит рекомендуемые материалы (видео и книги), к которым следует обратиться при возникновении трудностей при решении задач или ответах на вопросы.