diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..e6ebc35
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,3 @@
+.idea/
+target/
+*.iml
\ No newline at end of file
diff --git a/.idea/.gitignore b/.idea/.gitignore
new file mode 100644
index 0000000..0e40fe8
--- /dev/null
+++ b/.idea/.gitignore
@@ -0,0 +1,3 @@
+
+# Default ignored files
+/workspace.xml
\ No newline at end of file
diff --git a/.idea/1_Basics_of_software_code_development.iml b/.idea/1_Basics_of_software_code_development.iml
new file mode 100644
index 0000000..d6ebd48
--- /dev/null
+++ b/.idea/1_Basics_of_software_code_development.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..05f155c
--- /dev/null
+++ b/.idea/compiler.xml
@@ -0,0 +1,52 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/misc.xml b/.idea/misc.xml
new file mode 100644
index 0000000..55bbffe
--- /dev/null
+++ b/.idea/misc.xml
@@ -0,0 +1,27 @@
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
new file mode 100644
index 0000000..23e81d8
--- /dev/null
+++ b/.idea/modules.xml
@@ -0,0 +1,25 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/uiDesigner.xml b/.idea/uiDesigner.xml
new file mode 100644
index 0000000..e96534f
--- /dev/null
+++ b/.idea/uiDesigner.xml
@@ -0,0 +1,124 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ 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/Task1/.gitignore b/Task1/.gitignore
new file mode 100644
index 0000000..e6ebc35
--- /dev/null
+++ b/Task1/.gitignore
@@ -0,0 +1,3 @@
+.idea/
+target/
+*.iml
\ No newline at end of file
diff --git a/Task1/Task1.iml b/Task1/Task1.iml
new file mode 100644
index 0000000..d04ccda
--- /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..0e972ba
--- /dev/null
+++ b/Task1/pom.xml
@@ -0,0 +1,24 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#1
+ 1.0-SNAPSHOT
+
+
+
+ org.apache.maven.plugins
+ maven-compiler-plugin
+
+ 7
+ 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
new file mode 100644
index 0000000..b35c92c
--- /dev/null
+++ b/Task1/src/main/java/Task_1.java
@@ -0,0 +1,23 @@
+import com.sun.xml.internal.ws.api.model.wsdl.WSDLOutput;
+import org.w3c.dom.ls.LSOutput;
+
+import java.util.Scanner;
+
+public class Task_1 {
+
+ //1. Найдите значение функции: z = ((a – 3 )*b/2) + c.
+ public static void main(String[] args) {
+
+ Scanner scanner = new Scanner(System.in);
+ double a, b, c;
+ System.out.println("Enter value of a");
+ a = scanner.nextDouble();
+ System.out.println("Enter value of b");
+ b = scanner.nextDouble();
+ System.out.println("Enter value of c");
+ c = scanner.nextDouble();
+ double z = ((a - 3) * b / 2) + c;
+ System.out.println("The Result is = " + z);
+ scanner.close();
+ }
+}
diff --git a/Task1/src/main/java/by/learn/CheckLiterals.java b/Task1/src/main/java/by/learn/CheckLiterals.java
new file mode 100644
index 0000000..fc64427
--- /dev/null
+++ b/Task1/src/main/java/by/learn/CheckLiterals.java
@@ -0,0 +1,62 @@
+package by.learn;
+
+public class CheckLiterals {
+
+ public static void main(String[] args) {
+
+ // УРОК Arithmetics и привдение типов
+ int x = 8;
+ int y = 5;
+ int z = x / y; //1 если выходит дробная то обрезается до дробной
+ z = x % y; //3 остаток от деления тоже целочисленный
+
+ // С константами не нужно привдение типов
+ final byte a = 1;
+ final byte b = 2;
+ byte c = (a+b);
+
+ // Без констант нужно явное приведение типов
+ byte a1 = 1;
+ byte b1 =2;
+ byte c1 =(byte) (a1+b1);
+//******************************************************************
+ // Унарные операторы или арифметические/ Постфиксный и префиксный инкремент
+//*******************************************************************
+ int x1 = 1;
+ x1++; //2 Постфиксный инкремент
+ ++x1; // Префиксный инкремент
+ x = x + 1; //3
+
+ // Деление на 0
+
+ double b2 = 0.; // Да так можно, просто точку после 0
+ double a2 = 1/b2; //
+ System.out.println(a2); // Infinity
+
+ // Не число
+ double z1 = Math.sqrt(-1); // извлечем квадратный корень из -1
+ System.out.println(z1); // NaN
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ }
+}
+
+
+
+
diff --git a/Task1/src/main/java/by/learn/FlowControl.java b/Task1/src/main/java/by/learn/FlowControl.java
new file mode 100644
index 0000000..a3740ea
--- /dev/null
+++ b/Task1/src/main/java/by/learn/FlowControl.java
@@ -0,0 +1,23 @@
+package by.learn;
+
+public class FlowControl {
+
+
+
+
+
+
+
+ public static void main(String[] args) {
+
+ }
+
+
+
+
+
+
+
+
+
+}
diff --git a/Task1/src/main/java/by/learn/InstanceOfChecker.java b/Task1/src/main/java/by/learn/InstanceOfChecker.java
new file mode 100644
index 0000000..9615909
--- /dev/null
+++ b/Task1/src/main/java/by/learn/InstanceOfChecker.java
@@ -0,0 +1,32 @@
+
+package by.learn;
+
+class Granny {}
+class Father extends Granny {}
+class Son extends Father {}
+
+class Uncle extends Granny {}
+
+public class InstanceOfChecker {
+
+ // instanceof это с учетом наследования
+
+ public static void doAction(Granny c) {
+// Оператор instanceof срабатывает по значеню объекта а не по типу
+ if (c instanceof Father) {/*BaseCourse and FreeCourse */
+ System.out.println("for Father and Son");
+ } else if (c instanceof Uncle) {/*for OptionalCourse*/
+ System.out.println("for Uncle");
+ } else {/* for Course or null */
+ System.out.println("for Granny or null");
+ }
+ }
+
+ public static void main(String[] args) {
+ //Father gen = new Father();
+ //Son gen = new Son();
+ Granny gen = new Son();
+ doAction(gen);
+ }
+
+}
diff --git a/Task1/src/main/java/by/learn/LearnMain.java b/Task1/src/main/java/by/learn/LearnMain.java
new file mode 100644
index 0000000..f979177
--- /dev/null
+++ b/Task1/src/main/java/by/learn/LearnMain.java
@@ -0,0 +1,42 @@
+package by.learn;
+
+public class LearnMain {
+ public static void main(String[] args) {
+
+ // ЛИТЕРАЛЫ в JAVA (https://learn.by/courses/course-v1:EPAM+JF+ext1/courseware/2995d3584b1b4324985cc16c0e09c31c/cfb71d7abfaf493084d55fa99e4f02ce/1)
+
+ int x = 1; // Десятичный целочисленный литерал
+ int z = 671_010_001; // _671_00 -нельзя вначале и вконце, но можно 671_1_7_____1 (было добавлено для визуального восприятия тысяч, миллионов и т/д)
+ int y = 017; // Ноль вначале указывает на то, что это восьмеричное значение
+ // если перевести его в десятичное то будет 15 (не 17 как может показаться, именно 15)
+ // 8 уже не приемлемо
+ int c = 0x656af; // Можно Х большое использовать (без разницы), а также допустимо использовать символы от a до f
+ int b = 0b101011; // c Java 7 добавлены двоичные числа, т/е сначала 0b (можно и 0B) потом двоичное число 1011010
+
+ byte a = 127;
+ long k = 6710101245L; // если в конец не добавить L, то преобразуется к int автоматически
+ double d = 1.555;
+ double d1 = .07;// можно 0 до точки не ставить, две точки не допустимо
+ double d2 = 1.7e+2; // у этаго литерала есть sientific зависимость (степень только целочисленная)
+ float f = 5.11F; // Здесь по аналогии с int и long (но наоборот от больше к меньшему) т/е по умолчанию литералы с плавающей точкой по умолчанию double
+ // поэтому в конце добавляем F или f (без разницы
+ float f1 = 5.1_1F; // можно добавить и сюда нижнее подчеруивание для удобочитаемости
+
+ boolean flag = false;
+ char ch = 48; // выводит код симовола т/е System.out.println(ch); будет 0
+ char ch1 = 'A'; // 65
+ char ch2 = '\n';// '\b' -big (переход на 1 символ), '\f' -farm (новая страница), '\n' -nitro, '\t' -tractor, '\r' - перевод каретки вначало строки
+ char ch3 = '\255'; // это ASCII код 65000
+ char ch4 = '\uffff'; // начало '\u0000' (по умолчанию для char) конец '\uffff'
+
+ String str = null; // проблема на $1 000 000
+ String str1 = "java"; // является строковым литералом и храниться в пуле литералов
+ Object ob = null;
+
+
+ }
+}
+
+
+
+
diff --git a/Task1/src/main/java/by/learn/Logical.java b/Task1/src/main/java/by/learn/Logical.java
new file mode 100644
index 0000000..6caa1e7
--- /dev/null
+++ b/Task1/src/main/java/by/learn/Logical.java
@@ -0,0 +1,30 @@
+package by.learn;
+
+public class Logical {
+ public static void main(String[] args) {
+ int x = 1;
+ int y = 1;
+ boolean a1 = x == y; // true
+ boolean b1 = x != y; // false
+ System.out.println(x++ == y++ && x++ != y++); // выполнит только 1 сравнение
+ System.out.println("x= " + x + ", y "+ y);
+
+ boolean a2 = x == y; // true
+ boolean b2 = x != y; // false
+ System.out.println(x++ != y++ && x++ == y++);// выполнит 1 и 2 сравнение
+ System.out.println("x= " + x + ", y "+ y);
+
+ boolean a3 = x == y; // true
+ boolean b3 = x != y; // false
+ System.out.println(x++ != y++ || x++ == y++); // выполнит 1 и 2
+ System.out.println("x= " + x + ", y "+ y);
+
+ boolean a4 = x == y; // true
+ boolean b4 = x != y; // false
+ System.out.println(x++ == y++ || x++ != y++);// выполнит только 1
+ System.out.println("x= " + x + ", y "+ y);
+
+
+ }
+
+}
diff --git a/Task1/src/main/java/by/learn/OperatorsEqualityAndRelational.java b/Task1/src/main/java/by/learn/OperatorsEqualityAndRelational.java
new file mode 100644
index 0000000..42dcff6
--- /dev/null
+++ b/Task1/src/main/java/by/learn/OperatorsEqualityAndRelational.java
@@ -0,0 +1,24 @@
+package by.learn;
+
+public class OperatorsEqualityAndRelational {
+ public static void main(String[] args) {
+
+ // УРОК
+ // Вот такой прикол, что числа имеющее семь 0 после запятой будут одинаковые
+ // так как здесь имеется ограничение. Числа в периоде в математики и информатике не
+ // одно и тоже до определенного значения
+
+ // МАШИННЫЙ 0 Помнить о нем следует всегда
+ // Вот почему не используем float или double для подсчёта денег
+
+ float result = 1 / 3.0f * 3;
+
+ System.out.println(1.f == result); // true
+
+ System.out.println(1.0000000146568481f == 1.000000051546f); // true
+
+
+ }
+
+
+}
diff --git a/Task1/target/classes/META-INF/Task1.kotlin_module b/Task1/target/classes/META-INF/Task1.kotlin_module
new file mode 100644
index 0000000..2983af7
Binary files /dev/null and b/Task1/target/classes/META-INF/Task1.kotlin_module differ
diff --git a/Task1/target/classes/Task_1.class b/Task1/target/classes/Task_1.class
new file mode 100644
index 0000000..3e61107
Binary files /dev/null and b/Task1/target/classes/Task_1.class differ
diff --git a/Task1/target/classes/by/learn/CheckLiterals.class b/Task1/target/classes/by/learn/CheckLiterals.class
new file mode 100644
index 0000000..ee36f1a
Binary files /dev/null and b/Task1/target/classes/by/learn/CheckLiterals.class differ
diff --git a/Task1/target/classes/by/learn/Father.class b/Task1/target/classes/by/learn/Father.class
new file mode 100644
index 0000000..1f4a1c8
Binary files /dev/null and b/Task1/target/classes/by/learn/Father.class differ
diff --git a/Task1/target/classes/by/learn/FlowControl.class b/Task1/target/classes/by/learn/FlowControl.class
new file mode 100644
index 0000000..dabb105
Binary files /dev/null and b/Task1/target/classes/by/learn/FlowControl.class differ
diff --git a/Task1/target/classes/by/learn/Granny.class b/Task1/target/classes/by/learn/Granny.class
new file mode 100644
index 0000000..397f54c
Binary files /dev/null and b/Task1/target/classes/by/learn/Granny.class differ
diff --git a/Task1/target/classes/by/learn/InstanceOfChecker.class b/Task1/target/classes/by/learn/InstanceOfChecker.class
new file mode 100644
index 0000000..83cf50f
Binary files /dev/null and b/Task1/target/classes/by/learn/InstanceOfChecker.class differ
diff --git a/Task1/target/classes/by/learn/LearnMain.class b/Task1/target/classes/by/learn/LearnMain.class
new file mode 100644
index 0000000..1819e49
Binary files /dev/null and b/Task1/target/classes/by/learn/LearnMain.class differ
diff --git a/Task1/target/classes/by/learn/Logical.class b/Task1/target/classes/by/learn/Logical.class
new file mode 100644
index 0000000..8d8502d
Binary files /dev/null and b/Task1/target/classes/by/learn/Logical.class differ
diff --git a/Task1/target/classes/by/learn/OperatorsEqualityAndRelational.class b/Task1/target/classes/by/learn/OperatorsEqualityAndRelational.class
new file mode 100644
index 0000000..c0325b4
Binary files /dev/null and b/Task1/target/classes/by/learn/OperatorsEqualityAndRelational.class differ
diff --git a/Task1/target/classes/by/learn/Son.class b/Task1/target/classes/by/learn/Son.class
new file mode 100644
index 0000000..904e7e5
Binary files /dev/null and b/Task1/target/classes/by/learn/Son.class differ
diff --git a/Task1/target/classes/by/learn/Uncle.class b/Task1/target/classes/by/learn/Uncle.class
new file mode 100644
index 0000000..1aaf581
Binary files /dev/null and b/Task1/target/classes/by/learn/Uncle.class differ
diff --git a/Task10/pom.xml b/Task10/pom.xml
new file mode 100644
index 0000000..2c5cb77
--- /dev/null
+++ b/Task10/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#10
+ 1.0-SNAPSHOT
+
+
+
\ 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..52dde8d
--- /dev/null
+++ b/Task10/src/main/java/Task_10.java
@@ -0,0 +1,29 @@
+
+import java.util.Scanner;
+
+public class Task_10 {
+ public static void main(String[] args) {
+
+ // 4. Заданы размеры А, В прямоугольного отверстия и размеры х, у, z кирпича.
+ // Определить, пройдет ли кирпич через отверстие.
+ Scanner scanner = new Scanner(System.in);
+ System.out.println("Enter a side of hole A:");
+ int a = scanner.nextInt();
+ System.out.println("Enter a side of hole B:" );
+ int b = scanner.nextInt();
+
+ System.out.println("Enter a side of brick x:" );
+ int x = scanner.nextInt();
+ System.out.println("Enter a side of brick y:" );
+ int y = scanner.nextInt();
+ System.out.println("Enter a side of brick z:" );
+ int z = scanner.nextInt();
+
+ if (a >= y && b >= x || a >= x && b >= y)
+ System.out.println("The brick is passed ");
+ else
+ System.out.println("The brick is not passed ");
+
+ scanner.close();
+ }
+}
diff --git a/Task11/pom.xml b/Task11/pom.xml
new file mode 100644
index 0000000..47e9498
--- /dev/null
+++ b/Task11/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#11
+ 1.0-SNAPSHOT
+
+
+
\ No newline at end of file
diff --git a/Task11/src/main/java/Task_11.java b/Task11/src/main/java/Task_11.java
new file mode 100644
index 0000000..6e9342f
--- /dev/null
+++ b/Task11/src/main/java/Task_11.java
@@ -0,0 +1,20 @@
+import java.util.Scanner;
+
+public class Task_11 {
+ public static void main(String[] args) {
+
+ //Вычислить значение функции:
+ Scanner scanner = new Scanner(System.in);
+ System.out.println(" Enter x ");
+ double x = scanner.nextDouble();
+
+ double g, z;
+ if (x<=3){
+ z = Math.pow(x,2)-3*x+9;
+ System.out.printf("Result 1: %.1f ", z);
+ } else if (x > 3) {
+ g = 1 / (Math.pow(x, 3) + 6);
+ System.out.printf("Result 2: %.1f ", g);
+ }
+ }
+}
diff --git a/Task12/pom.xml b/Task12/pom.xml
new file mode 100644
index 0000000..8ffe1d5
--- /dev/null
+++ b/Task12/pom.xml
@@ -0,0 +1,10 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#12
+ 1.0-SNAPSHOT
+
\ 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..cc03d2b
--- /dev/null
+++ b/Task12/src/main/java/Task_12.java
@@ -0,0 +1,17 @@
+import java.util.Scanner;
+
+public class Task_12 {
+ public static void main(String[] args) {
+
+ // 1. Напишите программу, где пользователь вводит любое целое положительное число.
+ // А программа суммирует все числа от 1 до введенного пользователем числа.
+ Scanner scanner = new Scanner(System.in);
+ System.out.println("Enter the number ");
+ int x = scanner.nextInt();
+ int z = 0;
+ for (int i = 1; i <= x; i++){
+ z+=i;
+ }
+ System.out.println("Sum of numbers from one is " + z);
+ }
+}
diff --git a/Task13/pom.xml b/Task13/pom.xml
new file mode 100644
index 0000000..8d3d598
--- /dev/null
+++ b/Task13/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ 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..7dbd917
--- /dev/null
+++ b/Task13/src/main/java/Task_13.java
@@ -0,0 +1,25 @@
+import java.util.Scanner;
+
+public class Task_13 {
+ public static void main(String[] args) {
+
+ Scanner scanner = new Scanner(System.in);
+ System.out.println("Enter start line A");
+ int a = scanner.nextInt();
+ System.out.println("Enter finish line B");
+ int b = scanner.nextInt();
+ System.out.println("Enter step h");
+ double h = scanner.nextDouble();
+ System.out.println("Enter the value of x");
+ int x = scanner.nextInt();
+ int y;
+
+ for (double i = a; i <= b; i = i + h) {
+ if (x > 2) {
+ y = x;
+ } else
+ y = -x;
+ System.out.println("x = "+ x + "\n" + "y = " + y);
+ }
+ }
+}
diff --git a/Task14/pom.xml b/Task14/pom.xml
new file mode 100644
index 0000000..610aca0
--- /dev/null
+++ b/Task14/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#14
+ 1.0-SNAPSHOT
+
+
+
\ 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..8e7bde4
--- /dev/null
+++ b/Task14/src/main/java/Task_14.java
@@ -0,0 +1,12 @@
+public class Task_14 {
+ public static void main(String[] args) {
+
+ // 3. Найти сумму квадратов первых ста чисел.
+ int s=0;
+ for (int i = 1; i <= 100; i++ ){
+ s+=i*i;
+ System.out.println(s);
+ }
+ System.out.println("Sum is " + s);
+ }
+}
diff --git a/Task15/pom.xml b/Task15/pom.xml
new file mode 100644
index 0000000..f4a27f4
--- /dev/null
+++ b/Task15/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#15
+ 1.0-SNAPSHOT
+
+
+
\ 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..58d3896
--- /dev/null
+++ b/Task15/src/main/java/Task_15.java
@@ -0,0 +1,13 @@
+public class Task_15 {
+ public static void main(String[] args) {
+
+ // 4. Составить программу нахождения произведения квадратов первых двухсот чисел.
+ long s = 1 ;
+ for (int i = 1; i <= 200; i++) { //После 33 вышло за пределы диапазона 10 раз и выдало 0 (слишком большое число)
+ s =s*(i*i);
+ System.out.println("s " + s);
+ }
+ System.out.println("Sum is " + s);
+ }
+ }
+
diff --git a/Task16/pom.xml b/Task16/pom.xml
new file mode 100644
index 0000000..2e79eef
--- /dev/null
+++ b/Task16/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#16
+ 1.0-SNAPSHOT
+
+
+
\ 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..c3ff0bb
--- /dev/null
+++ b/Task16/src/main/java/Task_16.java
@@ -0,0 +1,28 @@
+import java.util.Scanner;
+
+public class Task_16 {
+
+ public static void main(String[] args) {
+
+ // Даны числовой ряд и некоторое число е. Найти сумму тех членов ряда, модуль которых больше или равен
+ // заданному е. Общий член ряда имеет вид: a = 1/2^n + 1/3^n;
+
+ System.out.println("Input е");
+ Scanner scanner = new Scanner(System.in);
+ double e = scanner.nextDouble();
+
+ int n = 0;
+ double sum = 0;
+ System.out.println("Print a series of common member series: ");
+ for (int i = 0; i<=10; i++){
+ ++n;
+ System.out.print("\n");
+ double a = (1/Math.pow(2,n))+ (1/Math.pow(3,n));
+ System.out.printf("%.4f", a);
+ if (e <= Math.abs(a))
+ sum = sum+a;
+ System.out.printf(" sum is %f", sum);
+
+ }
+ }
+}
diff --git a/Task17/pom.xml b/Task17/pom.xml
new file mode 100644
index 0000000..e6058c2
--- /dev/null
+++ b/Task17/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#17
+ 1.0-SNAPSHOT
+
+
+
\ 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..11d5ea2
--- /dev/null
+++ b/Task17/src/main/java/Task_17.java
@@ -0,0 +1,15 @@
+public class Task_17 {
+ public static void main(String[] args) {
+
+ // Циклы
+ //6. Вывести на экран соответствий между символами и их численными обозначениями в памяти компьютера.
+
+ char charsSigns = '\u0000';
+ int charsNumber = 0;
+ for (int i = 0; i<= 10000; i++){
+ charsSigns++;
+ charsNumber++;
+ System.out.println("sign: " + charsSigns + " number: " + charsNumber);
+ }
+ }
+}
diff --git a/Task18/pom.xml b/Task18/pom.xml
new file mode 100644
index 0000000..bb6c183
--- /dev/null
+++ b/Task18/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#18
+ 1.0-SNAPSHOT
+
+
+
\ 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..ad8a831
--- /dev/null
+++ b/Task18/src/main/java/Task_18.java
@@ -0,0 +1,29 @@
+import java.util.Scanner;
+
+public class Task_18 {
+ public static void main(String[] args) {
+
+ // rus: Для каждого натурального числа в промежутке от m до n вывести все делители, кроме единицы и самого числа.
+ // m и n вводятся с клавиатуры.
+
+ // eng: For each positive integer in the range from m to n, print all dividers except for the unit and the number itself.
+ // m and n are entered from the keyboard.
+
+ Scanner scanner = new Scanner(System.in);
+ System.out.println("Enter start of line numbers m ");
+ int m = scanner.nextInt();
+ System.out.println("Enter end of line numbers n ");
+ int n = scanner.nextInt();
+
+ while (m <= n) {
+ System.out.print("\n number: " + m);
+ System.out.print(" its dividers: ");
+ for (int i = 2; i <= m - 1; i++) {
+ if (m % i == 0) {
+ System.out.print(i + ",");
+ }
+ }
+ m = m + 1;
+ }
+ }
+}
diff --git a/Task19/pom.xml b/Task19/pom.xml
new file mode 100644
index 0000000..9293d7a
--- /dev/null
+++ b/Task19/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#19
+ 1.0-SNAPSHOT
+
+
+
\ 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..6f90b97
--- /dev/null
+++ b/Task19/src/main/java/Task_19.java
@@ -0,0 +1,31 @@
+import java.util.Scanner;
+
+public class Task_19 {
+
+ public static void main(String[] args) {
+
+ // 8. Даны два числа. Определить цифры, входящие в запись как первого так и второго числа.
+
+ Scanner scanner = new Scanner(System.in);
+ System.out.println("Enter number a: ");
+ String a = scanner.nextLine();
+ System.out.println("Enter number b: ");
+ String b = scanner.nextLine();
+
+ for (int f = 0; f < a.length(); f++) {
+ a.charAt(f);
+ }
+ System.out.println(" ");
+ for (int g = 0; g < b.length(); g++) {
+ b.charAt(g);
+ }
+ System.out.println("\n The same numbers from two lines is: ");
+ for (int i = 0; i < a.length(); i++) {
+ for (int j = 0; j < b.length(); j++) {
+ if (a.charAt(i) == b.charAt(j)) {
+ System.out.print("|" + b.charAt(j));
+ }
+ }
+ }
+ }
+ }
diff --git a/Task2/.gitignore b/Task2/.gitignore
new file mode 100644
index 0000000..e6ebc35
--- /dev/null
+++ b/Task2/.gitignore
@@ -0,0 +1,3 @@
+.idea/
+target/
+*.iml
\ No newline at end of file
diff --git a/Task3/.gitignore b/Task3/.gitignore
new file mode 100644
index 0000000..e6ebc35
--- /dev/null
+++ b/Task3/.gitignore
@@ -0,0 +1,3 @@
+.idea/
+target/
+*.iml
\ No newline at end of file
diff --git a/Task3/Task3.iml b/Task3/Task3.iml
new file mode 100644
index 0000000..8d8ffd9
--- /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..5b314c7
--- /dev/null
+++ b/Task3/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ 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..518b47d
--- /dev/null
+++ b/Task3/src/main/java/Task_3.java
@@ -0,0 +1,16 @@
+import java.util.Scanner;
+
+public class Task_3 {
+ public static void main(String[] args) {
+ Scanner scanner = new Scanner(System.in);
+ double x, y, c;
+ System.out.println("Enter value of x");
+ x = scanner.nextDouble();
+ System.out.println("Enter value of y");
+ y = scanner.nextDouble();
+ c = (Math.sin(x)+Math.cos(y))/(Math.cos(x) - Math.sin(y)) * Math.tan(x*y);
+ System.out.printf("The Result is = %.2f", c);
+ scanner.close();
+
+ }
+}
diff --git a/Task3/target/classes/Task_3.class b/Task3/target/classes/Task_3.class
new file mode 100644
index 0000000..4828eb6
Binary files /dev/null and b/Task3/target/classes/Task_3.class differ
diff --git a/Task4/.gitignore b/Task4/.gitignore
new file mode 100644
index 0000000..e6ebc35
--- /dev/null
+++ b/Task4/.gitignore
@@ -0,0 +1,3 @@
+.idea/
+target/
+*.iml
\ No newline at end of file
diff --git a/Task4/Task4.iml b/Task4/Task4.iml
new file mode 100644
index 0000000..8d8ffd9
--- /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..b799261
--- /dev/null
+++ b/Task4/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ 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..01bce3c
--- /dev/null
+++ b/Task4/src/main/java/Task_4.java
@@ -0,0 +1,17 @@
+import java.util.Scanner;
+
+public class Task_4 {
+ public static void main(String[] args) {
+ // 4. Дано действительное число R вида nnn.ddd (три цифровых разряда в дробной и целой частях).
+ // Поменять местами дробную и целую части числа и вывести полученное значение числа.
+ String str;
+ Scanner scanner = new Scanner(System.in);
+ System.out.println("Enter the three-digit number with a three-digit fractional part: ");
+ str = scanner.nextLine();
+ String [] rep = str.split("\\."); // Забыл экранировать, аааа блядь
+ String swap = rep[1];
+ rep[1] = rep[0];
+ rep[0] = swap;
+ System.out.println(rep[0] + "." + rep[1]);
+ }
+}
diff --git a/Task5/.gitignore b/Task5/.gitignore
new file mode 100644
index 0000000..e6ebc35
--- /dev/null
+++ b/Task5/.gitignore
@@ -0,0 +1,3 @@
+.idea/
+target/
+*.iml
\ No newline at end of file
diff --git a/Task5/pom.xml b/Task5/pom.xml
new file mode 100644
index 0000000..e56fadf
--- /dev/null
+++ b/Task5/pom.xml
@@ -0,0 +1,24 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#5
+ 1.0-SNAPSHOT
+
+
+
+ org.apache.maven.plugins
+ maven-compiler-plugin
+
+ 8
+ 8
+
+
+
+
+
+
+
\ 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..0ca3b28
--- /dev/null
+++ b/Task5/src/main/java/Task_5.java
@@ -0,0 +1,17 @@
+import java.util.Scanner;
+
+public class Task_5 {
+ public static void main(String[] args) {
+ int hours, minutes, seconds;
+ Scanner scanner = new Scanner(System.in);
+ System.out.println("Enter the natural number of seconds");
+ int inputSecond = scanner.nextInt();
+ hours = inputSecond/3600;
+ minutes = (inputSecond%3600)/60;
+ seconds = ((inputSecond%3600))%60;
+ System.out.printf("%02dч ",hours);
+ System.out.printf("%02dмин ",minutes);
+ System.out.printf("%02dс",seconds);
+ scanner.close();
+ }
+}
diff --git a/Task6/.gitignore b/Task6/.gitignore
new file mode 100644
index 0000000..e6ebc35
--- /dev/null
+++ b/Task6/.gitignore
@@ -0,0 +1,3 @@
+.idea/
+target/
+*.iml
\ No newline at end of file
diff --git a/Task6/pom.xml b/Task6/pom.xml
new file mode 100644
index 0000000..eb52ab3
--- /dev/null
+++ b/Task6/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ 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..2363b36
--- /dev/null
+++ b/Task6/src/main/java/Task_6.java
@@ -0,0 +1,20 @@
+import java.util.Scanner;
+
+public class Task_6 {
+ public static void main(String[] args) {
+ // Таск 6: Для данной области составить линейную программу, которая печатает true, если точка с координатами (х, у)
+ // принадлежит закрашенной области, и false — в противном случае:
+ Scanner scanner = new Scanner(System.in);
+ System.out.println("Enter x");
+ int x = scanner.nextInt();
+ System.out.println("Enter y");
+ int y = scanner.nextInt();
+ if (-4 <= x && x <= 4 && -3 <= y && y <= 0 ){
+ System.out.println("The point into shape");
+ }
+ else if (-2 <=x && x <= 2 && 0 <= y && y <= 4 ){
+ System.out.println("The point into shape");
+ } else
+ System.out.println("The point outer the shape");
+ }
+}
diff --git a/Task7/pom.xml b/Task7/pom.xml
new file mode 100644
index 0000000..e6440f7
--- /dev/null
+++ b/Task7/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#7
+ 1.0-SNAPSHOT
+
+
+
\ 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..cc30070
--- /dev/null
+++ b/Task7/src/main/java/Task_7.java
@@ -0,0 +1,25 @@
+import java.util.Scanner;
+
+public class Task_7 {
+ public static void main(String[] args) {
+ // 1. Даны два угла треугольника (в градусах).
+ // Определить, существует ли такой треугольник, и если да, то будет ли он прямоугольным.
+ final int SUM_OF_ANGLE_TRIANGLE = 180;
+ int z;
+ Scanner scanner = new Scanner(System.in);
+ System.out.println("Enter the angle one");
+ int x = scanner.nextInt();
+ System.out.println("Enter the angle two");
+ int y = scanner.nextInt();
+ z = Math.abs(SUM_OF_ANGLE_TRIANGLE - (x + y)); // Math.abs() - всегда даёт положительный результат (меняет минус на плюс)
+ System.out.println(z);
+
+ if (z == 90 || x == 90 || y == 90) {
+ System.out.println("This is triangle and its right triangle");
+ } else if (SUM_OF_ANGLE_TRIANGLE == z + x + y){
+ System.out.println("This is triangle");
+ } else {
+ System.out.println("This is not triangle");
+ }
+ }
+}
diff --git a/Task8/.gitignore b/Task8/.gitignore
new file mode 100644
index 0000000..e6ebc35
--- /dev/null
+++ b/Task8/.gitignore
@@ -0,0 +1,3 @@
+.idea/
+target/
+*.iml
\ No newline at end of file
diff --git a/Task8/pom.xml b/Task8/pom.xml
new file mode 100644
index 0000000..28b8cd2
--- /dev/null
+++ b/Task8/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#8
+ 1.0-SNAPSHOT
+
+
+
\ 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..bd8e0b3
--- /dev/null
+++ b/Task8/src/main/java/Task_8.java
@@ -0,0 +1,20 @@
+import java.util.Scanner;
+
+public class Task_8 {
+ public static void main(String[] args) {
+
+ // 2. Найти max{min(a, b), min(c, d)}
+ Scanner scanner = new Scanner(System.in);
+ System.out.println("Enter a");
+ int a = scanner.nextInt();
+ System.out.println("Enter b");
+ int b = scanner.nextInt();
+ System.out.println("Enter c");
+ int c = scanner.nextInt();
+ System.out.println("Enter d");
+ int d = scanner.nextInt();
+ int z = Math.max(Math.min(a,b),Math.min(c,d));
+ System.out.println("The value of max{min(a, b), min(c, d)} is " + z);
+ scanner.close();
+ }
+}
diff --git a/Task9/pom.xml b/Task9/pom.xml
new file mode 100644
index 0000000..f1fdf2b
--- /dev/null
+++ b/Task9/pom.xml
@@ -0,0 +1,12 @@
+
+
+ 4.0.0
+
+ Basic
+ Task#9
+ 1.0-SNAPSHOT
+
+
+
\ 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..955719b
--- /dev/null
+++ b/Task9/src/main/java/Task_9.java
@@ -0,0 +1,34 @@
+import java.util.Scanner;
+
+public class Task_9 {
+ public static void main(String[] args) {
+
+ // 3. Даны три точки А(х1,у1), В(х2,у2) и С(х3,у3).
+ // Определить, будут ли они расположены на одной прямой.
+ Scanner scanner = new Scanner(System.in);
+
+ System.out.println("Enter coordinates dot A:");
+ System.out.println("Enter x1 ");
+ int x1 = scanner.nextInt();
+ System.out.println("Enter y1");
+ int y1 = scanner.nextInt();
+
+ System.out.println("Enter coordinates dot B:");
+ System.out.println("Enter x2 ");
+ int x2 = scanner.nextInt();
+ System.out.println("Enter y2");
+ int y2 = scanner.nextInt();
+
+ System.out.println("Enter coordinates dot C:");
+ System.out.println("Enter x3 ");
+ int x3 = scanner.nextInt();
+ System.out.println("Enter y3");
+ int y3 = scanner.nextInt();
+
+ if (x1==x2 && x1==x3)
+ System.out.println("All dots is on one line");
+ else if(y1==y2 && y1==y3){
+ System.out.println("All dots is on one line");
+ } else System.out.println("Dots don't is on one line");
+ }
+}