-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathulohy.py
44 lines (37 loc) · 903 Bytes
/
ulohy.py
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
import math
def Task_1(list: list)-> float:
a = list[0]
for i in list[1:]:
a *= i
return a
def Task_2(list: list)-> float:
list.sort()
return list[0]
def Task_3(list: list)-> int:
n = 0
for i in list:
if is_prime(i):
n += 1
return n
def is_prime(num):
if num in [0,1,2]:
return True
if num % 2 == 0:
return False
for k in range(3,int(math.sqrt(num))+1,2):
if num % k == 0:
return False
return True
def Task_4(list: list, num: float)-> int:
answer = []
for i in range(len(list)):
if list[i] == num:
answer.append(i)
for k in answer[::-1]:
list.pop(k)
return answer
def Task_5(list_A: list, list_B):
return list(set(list_A).intersection(set(list_B)))
def Task_6(list: list,power):
result = [i**power for i in list]
return result