innopolis-python-course-tasks/week3T.py at main · Povasin/innopolis-python-course-tasks · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
# n = int(input())
# MassLines = ['' for x in range(n)]
# class lastOpenSym:
#     def __init__(self):
#         self.size = 0
#         self.items = [['', 0, 0] for x in range(10)]
#     def add(self,obj):
#         self.items[self.size] = obj
#         self.size +=1
#     def get(self):
#         return self.items[self.size-1]
#     def remove(self):
#         self.size -=1
#         self.items[self.size] = ['', 0,0]
# checkobj = {'(': ')', '[':']', '{':'}', '}':'{', ')':'(', ']':'['}
# l = lastOpenSym()
# def checkFunc(open,line,col):
#     global MassLines
#     if l.get()[0] != open:
#         if l.get()[0] == '[' or l.get()[0] == '(' or l.get()[0] == '{':
#             print(f"Error in line {line+1}, column {col+1}: expected '{checkobj[l.get()[0]]}', but got '{MassLines[line][col]}'.")
#             exit()
#     l.remove()
# for i in range(n):
#     MassLines[i] = input()
# for line in range(len(MassLines)):
#     for col in range(len(MassLines[line])):
#         if (l.get()[0] == '') and (MassLines[line][col] == ')' or MassLines[line][col] == ']' or MassLines[line][col] == '}'):
#             print(f"Error in line {line+1}, column {col+1}: unexpected closing '{MassLines[line][col]}'.")
#             exit()
#         if  MassLines[line][col] == '(' or MassLines[line][col] == '[' or MassLines[line][col] == '{':
#             l.add([MassLines[line][col], line, len(MassLines[line])])
#         if  MassLines[line][col] == ')' or MassLines[line][col] == ']' or MassLines[line][col] == '}':
#             checkFunc(checkobj[MassLines[line][col]],line,col)
# if l.get()[0]  != '':
#         print(f"Error in line {l.get()[1]+1}, column {l.get()[2]}: expected '{checkobj[l.get()[0]]}', but got end of input.")
#         exit()
# print("Input is properly balanced.")

# n = int(input())
# class orderCl:
#     def __init__(self):
#         self.size = 0
#         self.sizeResult = 0
#         self.beginning = 0
#         self.items = [None] *n
#         self.result = [None] *n
#     def top(self):
#         if self.beginning >= self.size:
#             self.result[self.sizeResult] = ['Empty']
#         else:
#             self.result[self.sizeResult] = self.items[self.beginning]
#         self.sizeResult += 1
#     def add(self, obj):
#         self.items[self.size] = obj
#         self.size+=1
#     def proceed(self):
#         if self.beginning < self.size:
#             self.beginning+=1
#     def get(self):
#         for i in range(self.sizeResult):
#             print(*self.result[i])
# order = orderCl()
# for i in range(n):
#     command = input().split()
#     if command[0] == 'Add':
#         order.add((command[1],command[2],command[3],command[4]))
#     if command[0] == 'Top':
#         order.top()
#     if command[0] == 'Proceed':
#         order.proceed()
# order.get()

# def func(n):
#     class Node:
#         def __init__(self, value, next):
#             self.value = value
#             self.next = next
#     class LinkedList:
#         def __init__(self):
#             self.size = 0
#             self.head = None
#         def reverse(self):
#             cur = self.head
#             before = None
#             while cur.next:
#                 temp = cur
#                 cur.next = before
#                 before = cur
#                 cur = temp
#             self.head = before
#             return before


# class order:
#     def __init__(self):
#         self.sizeStackAdd = 0
#         self.sizeStackDelete = 0
#         self.stackAdd = [None]*n
#         self.stackDelete = [None]*n
#     def size(self):
#         return self.sizeStackAdd+self.sizeStackDelete
#     def is_empty(self):
#         return  (order.size() == 0)

#     def offer(self,x):
#         self.stackAdd[self.sizeStackAdd] = x
#         self.sizeStackAdd += 1
#     def poll(self):
#         if order.is_empty():
#             while self.sizeStackAdd != 0:
#                 self.stackDelete[self.sizeStackDelete] = self.stackAdd[self.sizeStackAdd-1]
#                 self.sizeStackDelete+=1
#                 self.sizeStackAdd-=1
#             self.sizeStackDelete-=1
#             return  self.stackDelete[self.sizeStackDelete]
#         else:
#             return 'Очередь пустая'
#     def peek(self):
#         if order.is_empty():
#             return order.poll()
#         else:
#             return 'Очередь пустая'