From 6802999aa42305aeccbd8a1c4787318379965ee4 Mon Sep 17 00:00:00 2001 From: Holodenko_Artem <31826517+Acnologiak@users.noreply.github.com> Date: Tue, 14 Nov 2017 19:03:54 +0200 Subject: [PATCH 01/10] Create 1 --- km72/Holodenko_Artem/9/1 | 1 + 1 file changed, 1 insertion(+) create mode 100644 km72/Holodenko_Artem/9/1 diff --git a/km72/Holodenko_Artem/9/1 b/km72/Holodenko_Artem/9/1 new file mode 100644 index 00000000..8b137891 --- /dev/null +++ b/km72/Holodenko_Artem/9/1 @@ -0,0 +1 @@ + From e76bd2671f3541d6c527900a01c065442b546460 Mon Sep 17 00:00:00 2001 From: Holodenko_Artem <31826517+Acnologiak@users.noreply.github.com> Date: Tue, 14 Nov 2017 19:04:44 +0200 Subject: [PATCH 02/10] Homework9 --- km72/Holodenko_Artem/9/task1.py | 8 ++++++++ km72/Holodenko_Artem/9/task2.py | 6 ++++++ km72/Holodenko_Artem/9/task3.py | 8 ++++++++ 3 files changed, 22 insertions(+) create mode 100644 km72/Holodenko_Artem/9/task1.py create mode 100644 km72/Holodenko_Artem/9/task2.py create mode 100644 km72/Holodenko_Artem/9/task3.py diff --git a/km72/Holodenko_Artem/9/task1.py b/km72/Holodenko_Artem/9/task1.py new file mode 100644 index 00000000..0fefc2c5 --- /dev/null +++ b/km72/Holodenko_Artem/9/task1.py @@ -0,0 +1,8 @@ +def distance(x1, y1, x2, y2): + d = ((x1-x2)**2+(y1-y2))**0.5 + return d +x1 = float(input("Enter x1 ")) +y1 = float(input("Enter Y1 ")) +x2 = float(input("Enter x2 ")) +y2 = float(input("Enter Y2 ")) +print(distance(x1, y1, x2, y2)) diff --git a/km72/Holodenko_Artem/9/task2.py b/km72/Holodenko_Artem/9/task2.py new file mode 100644 index 00000000..a19ed613 --- /dev/null +++ b/km72/Holodenko_Artem/9/task2.py @@ -0,0 +1,6 @@ +def power(a, n): + a = a**n + return a +a = float(input("Enter a ")) +n = int(input("Enter n ")) +print(power(a, n)) diff --git a/km72/Holodenko_Artem/9/task3.py b/km72/Holodenko_Artem/9/task3.py new file mode 100644 index 00000000..82298dcd --- /dev/null +++ b/km72/Holodenko_Artem/9/task3.py @@ -0,0 +1,8 @@ +def power(a, n): + a1 = a + for i in range(n-1): + a = a*a1 + return a +a = float(input("Enter a ")) +n = int(input("Enter n ")) +print(power(a, n)) From 246cceccd2b67659b5ae8f23ac4070de198731b0 Mon Sep 17 00:00:00 2001 From: Holodenko_Artem <31826517+Acnologiak@users.noreply.github.com> Date: Tue, 14 Nov 2017 19:05:05 +0200 Subject: [PATCH 03/10] Delete 1 --- km72/Holodenko_Artem/9/1 | 1 - 1 file changed, 1 deletion(-) delete mode 100644 km72/Holodenko_Artem/9/1 diff --git a/km72/Holodenko_Artem/9/1 b/km72/Holodenko_Artem/9/1 deleted file mode 100644 index 8b137891..00000000 --- a/km72/Holodenko_Artem/9/1 +++ /dev/null @@ -1 +0,0 @@ - From e27e6bf08076de3002d82f3f59350f77a6c8cc39 Mon Sep 17 00:00:00 2001 From: Holodenko_Artem <31826517+Acnologiak@users.noreply.github.com> Date: Sun, 3 Dec 2017 19:07:17 +0200 Subject: [PATCH 04/10] Create task1 --- km72/Holodenko_Artem/12/task1 | 44 +++++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 km72/Holodenko_Artem/12/task1 diff --git a/km72/Holodenko_Artem/12/task1 b/km72/Holodenko_Artem/12/task1 new file mode 100644 index 00000000..e84a982b --- /dev/null +++ b/km72/Holodenko_Artem/12/task1 @@ -0,0 +1,44 @@ +def read_m(): + s = input("Введіть послідовність чисел: ") + s = s.split(' ') + if len(s) > 1: + return s + else: + print("Помилка, ви ввели менше чим 2 числа.") + return read_m() + return s + + +def int_m(m, i, l, s): + m.append(int(s[i])) + if i == l: + return m + return int_m(m, i+1, l, s) + + +def max_n(m, l, x, i): + if x < m[i]: + x = m[i] + if l == i: + return x + return max_n(m, l, x, i+1) + + +def del_x(m, i, l, s, x): + if s[i] != x: + m.append(int(s[i])) + if i == l: + return m + return del_x(m, i+1, l, s, x) + + +m = read_m() +l = len(m) +m = int_m([], 0, l-1, m) + +x = max_n(m, l-1, m[0], 1) + +m = del_x([], 0, l-1, m, x) + +l = len(m) +print("Друге за величиною число в масиві:", max_n(m, l-1, m[0], 1)) From 93ff39df0f57120494516cc9211e32f6b9ac0614 Mon Sep 17 00:00:00 2001 From: Holodenko_Artem <31826517+Acnologiak@users.noreply.github.com> Date: Sun, 3 Dec 2017 19:09:43 +0200 Subject: [PATCH 05/10] Create task2 --- km72/Holodenko_Artem/12/task2 | 40 +++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 km72/Holodenko_Artem/12/task2 diff --git a/km72/Holodenko_Artem/12/task2 b/km72/Holodenko_Artem/12/task2 new file mode 100644 index 00000000..eb53d7f5 --- /dev/null +++ b/km72/Holodenko_Artem/12/task2 @@ -0,0 +1,40 @@ +def read_m(): + s = input("Введіть послідовність чисел: ") + s = s.split(' ') + if len(s) == 1 and s[0] == '': + print("Помилка, ви ввели менше чим 1 число.") + return read_m() + return s + else: + return s + + +def int_m(m, i, l, s): + m.append(int(s[i])) + if i == l: + return m + return int_m(m, i+1, l, s) + + +def max_n(m, l, x, i): + if x < m[i]: + x = m[i] + if l == i: + return x + return max_n(m, l, x, i+1) + + +def eq_x(m, x, l, i, n): + if m[i] == x: + n += 1 + if l == i: + return n + return eq_x(m, x, l, i+1, n) + +m = read_m() +l = len(m) +m = int_m([], 0, l-1, m) + +x = max_n(m, l-1, m[0], 1) +s = eq_x(m, x, l-1, 0, 0) +print("Кількість чисел які дорівнюють максимальному елементу масиву:", s) From 7cc89e7c2240b67fd27eb2d0a0b647541e033bee Mon Sep 17 00:00:00 2001 From: Holodenko_Artem <31826517+Acnologiak@users.noreply.github.com> Date: Sun, 3 Dec 2017 19:12:40 +0200 Subject: [PATCH 06/10] Create task3 --- km72/Holodenko_Artem/12/task3 | 74 +++++++++++++++++++++++++++++++++++ 1 file changed, 74 insertions(+) create mode 100644 km72/Holodenko_Artem/12/task3 diff --git a/km72/Holodenko_Artem/12/task3 b/km72/Holodenko_Artem/12/task3 new file mode 100644 index 00000000..e2cf8a4a --- /dev/null +++ b/km72/Holodenko_Artem/12/task3 @@ -0,0 +1,74 @@ +def read_m(): + # функція вводу масиву чисел + s = input("Введіть послідовність чисел: ") + s = s.split(' ') + if len(s) == 1 and s[0] == '': + print("Помилка, ви ввели менше чим 1 число.") + return read_m() + return s + else: + return s + + +def int_m(m, i, l, s): + # функція перетворення типу даних str в int + m.append(int(s[i])) + if i == l: + return m + return int_m(m, i+1, l, s) + + +def func1(m, x, l, i, b, o): + # групування + if x == m[i]: + b.append(o) + else: + x = m[i] + o += 1 + b.append(o) + if i == l: + return b + return func1(m, x, l, i+1, b, o) + + +def func2(b, x, l, i, n, o, m, v): + # сумування + if b[i] == x: + o += 1 + if i == l: + n.append(o) + v.append(m[i]) + return n, v + return func2(b, x, l, i+1, n, o, m, v) + else: + v.append(m[i-1]) + n.append(o) + o = 1 + x = b[i] + if i == l: + n.append(o) + v.append(m[i]) + return n, v + return func2(b, x, l, i+1, n, o, m, v) + + +def max_n_print(m, l, x, i, v, z): + # функція яка знаходить максимальну кількість та сам елемент + if x < m[i]: + x = m[i] + z = v[i] + if l == i: + return x, z + return max_n_print(m, l, x, i+1, v, z) + + +m = read_m() +l = len(m) +m = int_m([], 0, l-1, m) +b = func1(m, m[0], l-1, 0, [], 1) +n, v = func2(b, b[0], l-1, 0, [], 0, m, []) +print(n) +print(v) +l = len(n) +x, z = max_n_print(n, l-1, n[0], 0, v, 0) +print("Відповідь", x, "група -", (str(z)+" ")*x) From 097dd58af7c1ebec9ca67f257724ef06f30b374d Mon Sep 17 00:00:00 2001 From: Holodenko_Artem <31826517+Acnologiak@users.noreply.github.com> Date: Sun, 3 Dec 2017 19:25:15 +0200 Subject: [PATCH 07/10] Create task1_1 --- km72/Holodenko_Artem/11/task1_1 | 44 +++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 km72/Holodenko_Artem/11/task1_1 diff --git a/km72/Holodenko_Artem/11/task1_1 b/km72/Holodenko_Artem/11/task1_1 new file mode 100644 index 00000000..c2201263 --- /dev/null +++ b/km72/Holodenko_Artem/11/task1_1 @@ -0,0 +1,44 @@ +def read_x(): + try: + x = float(input("Введіть x: ")) + except ValueError: + print("Помилка, ви ввенли не число.") + return read_x() + return x + + +def read_n(): + try: + n = float(input("Введіть n: ")) + except ValueError: + print("Помилка, ви ввенли не число.") + return read_n() + return n + + +def ch_zero(): + x = read_x() + n = read_n() + if x == n: + print("Помилка, ділення на 0!") + return ch_zero() + return x, n + + +def function(i, s, x, n): + s += (x**i-2*n)/(x-n) + i += 1 + if n == i: + return s + return function(i, s, x, n) + + +def testOnesDigit(): + print("Тест function()...", end="") + assert(function(1, 0, 2, 3) == 6) + print("Все вірно!") + + +a = ch_zero() +testOnesDigit() +print("Результат розрахунків:", function(1, 0, a[0], a[1])) From 19e480c21e6b38e58cd0d463e3f2c1cfb629154c Mon Sep 17 00:00:00 2001 From: Holodenko_Artem <31826517+Acnologiak@users.noreply.github.com> Date: Sun, 3 Dec 2017 19:25:45 +0200 Subject: [PATCH 08/10] Create task1_2 --- km72/Holodenko_Artem/11/task1_2 | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 km72/Holodenko_Artem/11/task1_2 diff --git a/km72/Holodenko_Artem/11/task1_2 b/km72/Holodenko_Artem/11/task1_2 new file mode 100644 index 00000000..7ff3b2b4 --- /dev/null +++ b/km72/Holodenko_Artem/11/task1_2 @@ -0,0 +1,12 @@ +def sum(x): + try: + xx = float(input("Введіть число: ")) + x += xx + except ValueError: + print("Помилка, ви ввенли не число.") + return sum(x) + if xx == 99999: + return x + return sum(x) +x = 0 +print("Сумма введених чисел: ", sum(x)-99999) From 9a0c39fe731c0e4c1210f1c2daacb900f710183a Mon Sep 17 00:00:00 2001 From: Holodenko_Artem <31826517+Acnologiak@users.noreply.github.com> Date: Sun, 3 Dec 2017 19:26:18 +0200 Subject: [PATCH 09/10] Create task2 --- km72/Holodenko_Artem/11/task2 | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 km72/Holodenko_Artem/11/task2 diff --git a/km72/Holodenko_Artem/11/task2 b/km72/Holodenko_Artem/11/task2 new file mode 100644 index 00000000..bfc127e3 --- /dev/null +++ b/km72/Holodenko_Artem/11/task2 @@ -0,0 +1,23 @@ +def read_m(m): + try: + x = int(input("Введіть число: ")) + except ValueError: + print("Помилка, ви ввенли не число.") + return read_m(m) + if x == 99999: + return m + else: + m.append(x) + return read_m(m) + + +def min_number(m, number, iterator): + if iterator == 0: + number = m[iterator] + if iterator == len(m)-1: + return(number) + elif m[iterator] > m[iterator+1]: + number = m[iterator+1] + return min_number(m, number, iterator+1) +print("Для завершення вводу введіть - '99999'") +print("Найменше число:", min_number(read_m([]), 0, 0)) From 5b4368a38e9635bffb10a77c1411e761d22fa14e Mon Sep 17 00:00:00 2001 From: Holodenko_Artem <31826517+Acnologiak@users.noreply.github.com> Date: Sun, 3 Dec 2017 19:26:48 +0200 Subject: [PATCH 10/10] Create task3 --- km72/Holodenko_Artem/11/task3 | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 km72/Holodenko_Artem/11/task3 diff --git a/km72/Holodenko_Artem/11/task3 b/km72/Holodenko_Artem/11/task3 new file mode 100644 index 00000000..caa9f559 --- /dev/null +++ b/km72/Holodenko_Artem/11/task3 @@ -0,0 +1,23 @@ +def read_m(m): + try: + x = int(input("Введіть число: ")) + except ValueError: + print("Помилка, ви ввенли не число.") + return read_m(m) + if x == 99999: + return m + else: + m.append(x) + return read_m(m) + + +def function(k, m, s): + s.append(m[k]) + if k == 0: + return s + k -= 1 + return function(k, m, s) +print("Для завершення вводу введіть - '99999'") +m = read_m([]) +l = len(m) +print(function(l-1, m, []))