Lab 5 piton

python/src/main.py

@@ -1,7 +1,10 @@
-def summ(a: int, b: int) -> int:
-    return a + b
-
+import sample
 
 if __name__ == "__main__":
-    print("Hello world")
-    print(summ(3, 4))
+    print("lab 5 python")
+    sobachka = sample.Dog(age=12, name="Zhychka", gender="male")
+
+    print(f"The dog's name is {sobachka.name}")
+    print(f"The dog {sobachka.name} is {sobachka.age} years old")
+    print(f"{sobachka.name} is a {sobachka.gender}")
+

python/src/module2/задача1.py

@@ -0,0 +1,20 @@
+def main(C, S):
+    count = 0
+    for j in range(C - 1):
+        for i in range(C - 1):
+            if S[i] > S[i + 1]:
+                S[i], S[i + 1] = S[i + 1], S[i]
+                count += 1
+                if count > 0:
+                    print(*S)
+    if count == 0:
+        print(0)
+
+
+C = int(input())
+if C == 1:
+    S = int(input())
+    print(S)
+else:
+    S = list(map(int, input().split()))
+    main(C, S)

python/src/module2/задача2.py

@@ -0,0 +1,30 @@
+def sortirovka(A):
+    number = list()
+    cost = list()
+    for i in range(A):
+        listik = list(map(int, input().split()))
+        number.append(listik[0])
+        cost.append(listik[-1])
+
+    for i in range(A- 1):
+        for j in range(A - 1):
+            if cost[j] == cost[j + 1]:
+                if number[j] < number[j + 1]:
+                    cost[j], cost[j + 1] = cost[j + 1], cost[j]
+                    number[j], number[j + 1] = number[j + 1], number[j]
+            else:
+                if cost[j] > cost[j + 1]:
+                    cost[j], cost[j + 1] = cost[j + 1], cost[j]
+                    number[j], number[j + 1] = number[j + 1], number[j]
+
+    for i in range(A - 1, -1, -1):
+        print(str(number[i]) + " " + str(cost[i]))
+
+
+
+A = int(input())
+if A == 1:
+    listik = list(map(int, input().split()))
+    print(*listik)
+else:
+    sortirovka(A) 

python/src/module2/задача4.py

@@ -0,0 +1,40 @@
+def merge(listik, listik_1, l, m, h):
+    t = l
+    i = l
+    j = m + 1
+    invers = 0
+    while i <= m and j <= h:
+        if listik[i] <= listik[j]:
+            listik_1[t] = listik[i]
+            i = i + 1
+        else:
+            listik_1[t] = listik[j]
+            j = j + 1
+            invers = invers + (m - i + 1)
+        t = t + 1
+    while i <= m:
+        listik_1[t] = listik[i]
+        t = t + 1
+        i = i + 1
+    for i in range(l, h + 1):
+        listik[i] = listik_1[i]
+    return invers
+
+def merge_sort(listik, listik_1, l, h):
+    if h <= l:    
+        return 0
+    m = l + ((h - l) >> 1)
+    invers = 0
+    invers = invers + merge_sort(listik, listik_1, l, m)      
+    invers = invers + merge_sort(listik, listik_1, m + 1, h)  
+    invers = invers + merge(listik, listik_1, l, m, h)     
+    return invers
+
+A = int(input())
+if A == 1:
+    listik = int(input())
+    print(0)
+else:
+    listik = list(map(int, input().split()))
+    listik_1 = listik.copy()
+    print(merge_sort(listik, listik_1, 0, len(listik) - 1))

python/src/module2/задача5.py

@@ -0,0 +1,28 @@
+def quick_sort(listik):
+    if len(listik) <= 1:
+        return listik
+    ciferka = listik[len(listik) // 2]
+    l = [i for i in listik if i < ciferka]
+    m = [i for i in listik if i == ciferka]
+    r = [i for i in listik if i > ciferka]
+    result = quick_sort(l) + m + quick_sort(r)
+    return result
+
+
+def duplicate(arr):
+    arr = quick_sort(arr)
+    result = []
+    for i in range(len(arr)):
+        if (i == 0) or (arr[i] != arr[i-1]):
+            result.append(arr[i])
+    return result
+
+
+A = int(input())
+if A == 1:
+    listik = int(input())
+    print(listik)
+else:
+    listik = list(map(int, input().split()))
+    listik = duplicate(listik)
+    print(len(listik))

python/src/module2/задача6.py

@@ -0,0 +1,24 @@
+def count_sort(listik, check):
+    answers = []   
+    mini = min(listik)
+    maxi = max(listik)
+    sup = [0 for i in range(maxi - mini + 1)]
+    for elem in listik:
+        sup[elem - mini] =  sup[elem - mini] + 1
+
+    for i in range(len(sup)):
+        if sup[i] <= check[i]:
+            answers.append('no')
+        else:
+            answers.append('yes')
+
+    for i in answers:
+        print(i)
+
+
+
+goods_types = int(input())           
+each_product = list(map(int, input().split()))
+orders_count = int(input())
+orders = list(map(int, input().split()))
+count_sort(orders, each_product)

python/src/module2/задача7.py

@@ -0,0 +1,52 @@
+def counting_sort(listik, position):
+    mini = min([int(x[position]) for x in listik])
+    maxi = max([int(x[position]) for x in listik])
+    number = maxi - mini + 1
+    support = [0 for i in range(number)]
+    for elem in listik:
+        support[int(elem[position]) - mini] = support[int(elem[position]) - mini] + 1
+    size = len(listik)
+    for i in range(number - 1, -1, -1):
+        size = size - support[i]
+        support[i] = size
+    result = [None for i in range(len(listik))]
+    for elem in listik:
+        result[support[int(elem[position]) - mini]] = elem
+        support[int(elem[position]) - mini] = support[int(elem[position]) - mini] + 1
+    return result
+
+
+def print_phase(listik, position):
+    print('Phase ' + str(abs(position)))
+    for i in range(10):
+        check= [x for x in listik if int(x[position]) == i]
+        print(f'Bucket {i}:', end=' ')
+        if len(check) > 0:
+            print(*check, sep=', ')
+        else:
+            print('empty')
+
+def radix_sort(listik):
+    digits_num = len(listik[0])
+    for i in range(-1, -(digits_num) - 1, -1):
+        listik = counting_sort(listik, i)
+        print_phase(listik, i)
+        print('*' * 10)
+    print("Sorted array:")
+    print(*listik, sep=", ")
+
+
+
+A = int(input())
+if A == 1:
+    listik = input()
+    print("Initial array:")
+    print(*listik, sep=", ")
+    print('*' * 10)
+    radix_sort(listik)
+else:
+    listik = [input() for _ in range(A)]
+    print("Initial array:")
+    print(*listik, sep=", ")
+    print('*' * 10)
+    radix_sort(listik)

python/src/module3/задача1.py

@@ -0,0 +1,34 @@
+def get_hash(stroka, len_stroka):
+    p = 10**9 + 7
+    x = 31
+    stroka_hash = 0
+    for i in range(len_stroka):
+        stroka_hash = (stroka_hash * x + ord(stroka[i])) % p
+    return stroka_hash
+
+def the_Rabin_Karp_algorithm(stroka, strochka):
+    p = 10**9 + 7
+    x = 31
+    stroka_hash = get_hash(stroka, len(strochka))
+    substring_hash = get_hash(strochka, len(strochka))
+    sliding_hash = 1
+    for i in range(len(strochka)):
+        sliding_hash = (sliding_hash * x) % p
+
+    list_s_indexami = []
+
+    for i in range(len(stroka) - len(strochka) + 1):
+        if substring_hash == stroka_hash:
+            list_s_indexami.append(i)
+        if i + len(strochka) < len(stroka):
+            stroka_hash = (stroka_hash * x - ord(stroka[i]) * sliding_hash + ord(stroka[i + len(strochka)])) % p
+            stroka_hash = (stroka_hash + p) % p
+    return list_s_indexami
+
+if __name__ == "__main__":
+    p = 10**9 + 7
+    x = 31
+    stroka = input()
+    strochka = input()
+    res = the_Rabin_Karp_algorithm(stroka, strochka)
+    print(*res)

python/src/module3/задача2.py

@@ -0,0 +1,33 @@
+def get_hash(stroka_t, len_stroka):
+    p = 10**9 + 7
+    x = 31
+    stroka_hash = 0
+    for i in range(len_stroka):
+        stroka_hash = (stroka_hash * x + ord(stroka_t[i])) % p
+    return stroka_hash
+
+def cyclic_shift(stroka_t, stroka_s):
+    p = 10**9 + 7
+    x = 31
+    string_hash = get_hash(stroka_t, len(stroka_s))
+    substring_hash = get_hash(stroka_s, len(stroka_s))
+    sliding_hash = 1
+    for i in range(len(stroka_s)):
+        sliding_hash = (sliding_hash * x) % p
+
+
+    for i in range(len(stroka_t) - len(stroka_s) + 1):
+        if substring_hash == string_hash:
+            return i
+        if i + len(stroka_s) < len(stroka_t):
+            string_hash = (string_hash * x - ord(stroka_t[i]) * sliding_hash + ord(stroka_t[i + len(stroka_s)])) % p
+            string_hash = (string_hash + p) % p
+    return -1
+
+if __name__ == "__main__":
+    stroka_s = input()
+    stroka_t = input()
+    stroka_t = stroka_t * 2
+    p = 10**9 + 7
+    x = 31
+    print(cyclic_shift(stroka_t, stroka_s))

python/src/module3/задача3.py

@@ -0,0 +1,26 @@
+def prefix_function(stroka):
+    res = [0] * len(stroka)
+    res[0] = 0
+    for i in range(len(stroka) - 1):
+        j = res[i]
+        while (j > 0) and (stroka[i + 1] != stroka[j]):
+            j = res[j - 1]
+        if stroka[i + 1] == stroka[j]:
+            res[i + 1] = j + 1
+        else:
+            res[i + 1] = 0
+    return res
+
+def repeated_string(stroka):
+    prefix = prefix_function(stroka)
+    n = len(stroka) - prefix[-1]
+    if len(stroka) % n == 0:
+        return n
+    return len(stroka)
+
+
+if __name__ == "__main__":
+    stroka = input()
+    strochka = repeated_string(stroka)
+    print(len(stroka) // strochka)
+

python/src/module3/задача4.py

@@ -0,0 +1,37 @@
+def z_function(string):
+    Z = [0] * len(string)
+    l = 0
+    r = 0
+    maximum_index = 0
+    for i in range(1, len(string)):
+        if i <= r:
+            Z[i] = min(r - i + 1, Z[i - l])
+        while i + Z[i] < len(string) and string[Z[i]] == string[Z[i] + i]:
+            Z[i] += 1
+
+        if Z[i] > Z[maximum_index]:
+            maximum_index = i
+
+        if i + Z[i] - 1 > r:
+            l = i
+            r = i + Z[i] - 1
+
+    return Z, maximum_index
+
+def min_len(string):
+    z, maximum_index = z_function(string)
+    if maximum_index + z[maximum_index] == len(string):
+        return len(string) - z[maximum_index]
+    else:
+        k = 0
+        for i in range(len(string) - 1, -1, -1):
+            if z[i] > k and z[i] < z[maximum_index] and i + z[i] == len(string):
+                k = z[i]             
+
+        return len(string) - k
+
+
+if __name__ == "__main__":
+    string = input()
+
+    print(min_len(string))

python/src/module4/задача1.py

@@ -0,0 +1,17 @@
+def psp(stroka):
+    stack = list()
+    extra_parenthesis = 0
+    for i in stroka:
+        if i == "(":
+            stack.append(i)
+        elif i == ")":
+            if len(stack) != 0:
+                stack.pop()
+            else:
+                extra_parenthesis = extra_parenthesis + 1
+    return len(stack) + extra_parenthesis
+
+if __name__ == "__main__":
+    stroka = input()
+    print(psp(stroka))
+