Advertisement
Guest User

Untitled

a guest
Jan 27th, 2020
94
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 4.39 KB | None | 0 0
  1. def nested_sum(list1):
  2.     total = 0
  3.     for i in list1:
  4.         total += sum(i)
  5.     return total
  6.  
  7.  
  8. def cumsum(lst):
  9.     total = 0
  10.     pom = []
  11.     for i in lst:
  12.         total += i
  13.         pom.append(total)
  14.     return pom
  15.  
  16.  
  17. def middle(lst):
  18.     newList = []
  19.     length = len(lst)
  20.     for i in range(1, length - 1):
  21.         newList.append(lst[i])
  22.     return newList
  23.  
  24.  
  25. def chop(lst):
  26.     del lst[0]
  27.     length = len(lst)
  28.     del lst[length - 1]
  29.  
  30.  
  31. def is_sorted(lst):
  32.     for i in range(0, len(lst)):
  33.         if i == 0:
  34.             if lst[i] > lst[i + 1]:
  35.                 return False
  36.         if i > 0:
  37.             if lst[i - 1] > lst[i]:
  38.                 return False
  39.     return True
  40.  
  41.  
  42. def ReturnNumberWEvenIndex(lst):
  43.     sum_v1 = 0
  44.     for i in range(0, len(lst)):
  45.         if i % 2 == 0:
  46.             sum_v1 += lst[i]
  47.     return sum_v1
  48.  
  49.  
  50. def ReturnNumbersHigherThanBothNeighs(lst):
  51.     count = 0
  52.     for i in range(0, len(lst)):
  53.         if i == 0:
  54.             continue
  55.         elif 0 < i < len(lst) - 1:
  56.             if lst[i - 1] < lst[i] > lst[i + 1]:
  57.                 count += 1
  58.     return count
  59.  
  60.  
  61. def ReturnOccurencesOfDifferentElements(lst):
  62.     count = 0
  63.     for i in range(0, len(lst)):
  64.         if i == 0:
  65.             continue
  66.         elif i > 0:
  67.             if lst[i - 1] != lst[i]:
  68.                 count += 1
  69.     return count
  70.  
  71.  
  72. def ReturnOccurencesOfUniqueElements(lst):
  73.     count = 0
  74.     pom = []
  75.     temp = 0
  76.     # lst.sort()
  77.     for i in range(0, len(lst)):
  78.         for j in range(0, len(lst) - i - 1):
  79.             if lst[j] > lst[j + 1]:
  80.                 temp = lst[j]
  81.                 lst[j] = lst[j + 1]
  82.                 lst[j + 1] = temp
  83.     for i in range(0, len(lst)):
  84.         if i == 0:
  85.             continue
  86.         if i > 0:
  87.             if lst[i - 1] == lst[i]:
  88.                 count = 0
  89.                 pom.clear()
  90.                 continue
  91.             else:
  92.                 if lst[i - 1] != lst[i]:
  93.                     pom.append(lst[i])
  94.                     count += 1
  95.     return count
  96.  
  97.  
  98. def areStringsEqual(str1, str2):
  99.     if len(str1) != len(str2):
  100.         return False
  101.     else:
  102.         for i in range(len(str1)):
  103.             if str1[i] != str2[i]:
  104.                 return False
  105.         return True
  106.  
  107.  
  108. def returnSumOf2Matrixes(A, B):
  109.     if len(A) != len(B) or len(A[0]) != len(B[0]):
  110.         print("Matice sa nedaju scitat")
  111.         return 0
  112.     else:
  113.         C = []
  114.         for i in range(len(A)):
  115.             C.append([])
  116.             for item in range(len(A)):
  117.                 C[i].append(0)
  118.         for i in range(len(A)):
  119.             for j in range(len(B[0])):
  120.                 C[i][j] = A[i][j] + B[i][j]
  121.     print(C)
  122.  
  123. def MultiplicationOfTwoMatrixes(A, B):
  124.     if len(A[0]) != len(B):
  125.         print("Matice sa nedaju nasobit")
  126.         return 0
  127.     else:
  128.         C = []
  129.         for i in range(len(A)):
  130.             C.append([])
  131.         for i in range(len(A)):
  132.             for j in range(len(B[0])):
  133.                 s = 0
  134.                 for k in range(len(A)):
  135.                     s += A[i][k] * B[k][j]
  136.                 C[i].append(s)
  137.     print(C)
  138.  
  139.  
  140. # TESTING
  141. """
  142. print("1. ULOHA 9.CVICENIE")
  143. print(nested_sum([[1, 2], [3], [4, 5, 6]]))
  144. print("\n")
  145.  
  146. print("2. ULOHA 9.CVICENIE")
  147. print(cumsum([1, 2, 3]))
  148. print("\n")
  149.  
  150. print("3. ULOHA 9.CVICENIE")
  151. print(middle([1, 2, 3, 4]))
  152. print("\n")
  153.  
  154. print("4. ULOHA 9.CVICENIE")
  155. lst = [1, 2, 3, 4]
  156. chop(lst)
  157. print(lst)
  158. print("\n")
  159.  
  160. print("5. ULOHA 9.CVICENIE")
  161. print(is_sorted([1, 2, 3, 4, 5, 6, 1]))
  162. print("\n")
  163.  
  164.  
  165. print("6. ULOHA 9.CVICENIE")
  166. print(ReturnNumberWEvenIndex([1, 2, 3, 4, 5, 6]))
  167. print("\n")
  168.  
  169. print("7. ULOHA 9.CVICENIE")
  170. print(ReturnNumbersHigherThanBothNeighs([1, 5, 2, 1, 6, 3]))
  171. print("\n")
  172.  
  173. print("8. ULOHA 9.CVICENIE")
  174. print(ReturnOccurencesOfDifferentElements([1, 2, 2, 3]))
  175. print("\n")
  176.  
  177. print("9. ULOHA 9 CVICENIE")
  178. print(ReturnOccurencesOfUniqueElements([10, 20, 30, 40, 50, 10, 20]))
  179. print("\n")
  180.  
  181. print("1. ULOHA 10 CVICENIE")
  182. print(areStringsEqual("ahoj", "ahoj"))
  183. print(areStringsEqual("ahoj", "ahoja"))
  184. print("\n")
  185.  
  186. print("1. ULOHA 10 CVICENIE")
  187. returnSumOf2Matrixes(A1, B1)
  188. print("\n")
  189.  
  190. print("2. ULOHA 10 CVICENIE")
  191. MultiplicationOfTwoMatrixes(A1, B1)
  192.  
  193.  
  194. print("\n")
  195. """
  196.  
  197. A1 = [[1, 2, 3], [4, 2, 6], [6, 6, 7]]
  198. B1 = [[1, 2, 2], [1, 2, 6], [6, 6, 7]]
  199. returnSumOf2Matrixes(A1, B1)
  200. MultiplicationOfTwoMatrixes(A1, B1)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement