Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def nested_sum(list1):
- total = 0
- for i in list1:
- total += sum(i)
- return total
- def cumsum(lst):
- total = 0
- pom = []
- for i in lst:
- total += i
- pom.append(total)
- return pom
- def middle(lst):
- newList = []
- length = len(lst)
- for i in range(1, length - 1):
- newList.append(lst[i])
- return newList
- def chop(lst):
- del lst[0]
- length = len(lst)
- del lst[length - 1]
- def is_sorted(lst):
- for i in range(0, len(lst)):
- if i == 0:
- if lst[i] > lst[i + 1]:
- return False
- if i > 0:
- if lst[i - 1] > lst[i]:
- return False
- return True
- def ReturnNumberWEvenIndex(lst):
- sum_v1 = 0
- for i in range(0, len(lst)):
- if i % 2 == 0:
- sum_v1 += lst[i]
- return sum_v1
- def ReturnNumbersHigherThanBothNeighs(lst):
- count = 0
- for i in range(0, len(lst)):
- if i == 0:
- continue
- elif 0 < i < len(lst) - 1:
- if lst[i - 1] < lst[i] > lst[i + 1]:
- count += 1
- return count
- def ReturnOccurencesOfDifferentElements(lst):
- count = 0
- for i in range(0, len(lst)):
- if i == 0:
- continue
- elif i > 0:
- if lst[i - 1] != lst[i]:
- count += 1
- return count
- def ReturnOccurencesOfUniqueElements(lst):
- count = 0
- pom = []
- temp = 0
- # lst.sort()
- for i in range(0, len(lst)):
- for j in range(0, len(lst) - i - 1):
- if lst[j] > lst[j + 1]:
- temp = lst[j]
- lst[j] = lst[j + 1]
- lst[j + 1] = temp
- for i in range(0, len(lst)):
- if i == 0:
- continue
- if i > 0:
- if lst[i - 1] == lst[i]:
- count = 0
- pom.clear()
- continue
- else:
- if lst[i - 1] != lst[i]:
- pom.append(lst[i])
- count += 1
- return count
- def areStringsEqual(str1, str2):
- if len(str1) != len(str2):
- return False
- else:
- for i in range(len(str1)):
- if str1[i] != str2[i]:
- return False
- return True
- def returnSumOf2Matrixes(A, B):
- if len(A) != len(B) or len(A[0]) != len(B[0]):
- print("Matice sa nedaju scitat")
- return 0
- else:
- C = []
- for i in range(len(A)):
- C.append([])
- for item in range(len(A)):
- C[i].append(0)
- for i in range(len(A)):
- for j in range(len(B[0])):
- C[i][j] = A[i][j] + B[i][j]
- print(C)
- def MultiplicationOfTwoMatrixes(A, B):
- if len(A[0]) != len(B):
- print("Matice sa nedaju nasobit")
- return 0
- else:
- C = []
- for i in range(len(A)):
- C.append([])
- for i in range(len(A)):
- for j in range(len(B[0])):
- s = 0
- for k in range(len(A)):
- s += A[i][k] * B[k][j]
- C[i].append(s)
- print(C)
- # TESTING
- """
- print("1. ULOHA 9.CVICENIE")
- print(nested_sum([[1, 2], [3], [4, 5, 6]]))
- print("\n")
- print("2. ULOHA 9.CVICENIE")
- print(cumsum([1, 2, 3]))
- print("\n")
- print("3. ULOHA 9.CVICENIE")
- print(middle([1, 2, 3, 4]))
- print("\n")
- print("4. ULOHA 9.CVICENIE")
- lst = [1, 2, 3, 4]
- chop(lst)
- print(lst)
- print("\n")
- print("5. ULOHA 9.CVICENIE")
- print(is_sorted([1, 2, 3, 4, 5, 6, 1]))
- print("\n")
- print("6. ULOHA 9.CVICENIE")
- print(ReturnNumberWEvenIndex([1, 2, 3, 4, 5, 6]))
- print("\n")
- print("7. ULOHA 9.CVICENIE")
- print(ReturnNumbersHigherThanBothNeighs([1, 5, 2, 1, 6, 3]))
- print("\n")
- print("8. ULOHA 9.CVICENIE")
- print(ReturnOccurencesOfDifferentElements([1, 2, 2, 3]))
- print("\n")
- print("9. ULOHA 9 CVICENIE")
- print(ReturnOccurencesOfUniqueElements([10, 20, 30, 40, 50, 10, 20]))
- print("\n")
- print("1. ULOHA 10 CVICENIE")
- print(areStringsEqual("ahoj", "ahoj"))
- print(areStringsEqual("ahoj", "ahoja"))
- print("\n")
- print("1. ULOHA 10 CVICENIE")
- returnSumOf2Matrixes(A1, B1)
- print("\n")
- print("2. ULOHA 10 CVICENIE")
- MultiplicationOfTwoMatrixes(A1, B1)
- print("\n")
- """
- A1 = [[1, 2, 3], [4, 2, 6], [6, 6, 7]]
- B1 = [[1, 2, 2], [1, 2, 6], [6, 6, 7]]
- returnSumOf2Matrixes(A1, B1)
- MultiplicationOfTwoMatrixes(A1, B1)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement