fib = [0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,17711]
def szukaj(liczba):
print("Dla liczby: " + str(liczba))
znaleziono = False
for id1 in range(len(fib)):
if fib[id1] > liczba:
break
for id2 in range(id1, len(fib)):
if fib[id1] * fib[id2] == liczba:
if znaleziono == False:
znaleziono = True
print(fib[id1], fib[id2])
else:
if fib[id2] > liczba:
break
if znaleziono == False:
print("Nie znaleziono:(")
szukaj(512)
szukaj(13)
szukaj(466)
szukaj(7)
import random
def los(ile):
losy = []
for iter in range(ile):
losy.append(random.randint(1,365+1))
return losy
def sprPowt(tablica):
powtorzenia = []
iloscPowtorzen = 0
for id1 in range(len(tablica)):
for id2 in range(id1+1, len(tablica)):
wart1 = tablica[id1]
wart2 = tablica[id2]
if(wart1 == wart2):
iloscPowtorzen += 1
powtorzenia.append(wart1)
print("Otrzymana tablica: ")
print(tablica)
print("Ilosc powtorzen: ")
print(iloscPowtorzen)
print("Powtorzenia: ")
print(powtorzenia)
# print(sprPowt(los(10)))
sprPowt(los(40))
# temp = 0
# tempid = 0
# while temp < 2:
# temp = sprPowt(los(20))
# tempid += 1
# print("Ilosc potworzen: " + str(temp) + " w ilosci krokow: " + str(tempid))
# print(sprPowt([1,1,2,3,4,5,5,5,6,7,8])) # => 4
def construct_ladder(pieces:list[int]):
ladders = 0
while len(pieces) > 0:
currPiece = pieces[0]
pieces.remove(currPiece)
if(currPiece == 10):
ladders += 1
continue
for piece in pieces:
if currPiece + piece == 10:
ladders += 1
pieces.remove(piece)
break
return ladders
print(construct_ladder([1,9,9,7,0,10,4,4,2,17,1,9,6,6]))
import random
def los(ile):
losy = []
for iter in range(ile):
losy.append(random.randint(1,365+1))
return losy
def sprPowt(tablica):
# print(tablica)
iloscPowtorzen = 0
for wart1 in tablica:
for wart2 in tablica:
if(wart1 == wart2):
iloscPowtorzen += 1
return int((iloscPowtorzen - len(tablica)) / 2)
# print(sprPowt(los(10)))
# print(sprPowt(los(20)))
temp = 0
tempid = 0
while temp < 5:
temp = sprPowt(los(20))
tempid += 1
print("Ilosc potworzen: " + str(temp) + " w ilosci krokow: " + str(tempid))
# print(sprPowt([1,1,2,3,4,5,5,5,6,7,8])) # => 4
def construct_ladder(pieces:list[int]):
ladders = 0
while len(pieces) > 0:
currPiece = pieces[0]
pieces.remove(currPiece)
for piece in pieces:
if currPiece + piece == 10:
ladders += 1
pieces.remove(piece)
break
return ladders
# print(construct_ladder([1,9,9,1,9,6,6]))
def get_large_numbers(w, min_num):
lista = []
for liczba in w:
if liczba >= min_num:
lista.append(liczba)
return lista
print(get_large_numbers([1,2,3,4,233,2346,456,11,663,21], 2345))
def best_acceleration(powers,masses):
best_acc = 0
power = 0
mass = 0
for current in range(len(powers)):
p = powers[current]
m = masses[current]
if p/m > best_acc:
best_acc = p/m
power = p
mass = m
return best_acc, power, mass
print(best_acceleration([1,2,3], [10, 200, 100]))
gfjtgf
def get_battery_wear(min_charge, max_charge):
poz = 0.00
for val in range(min_charge, max_charge):
if val in range(0, 50):
poz = poz + 0.01
if val in range(50, 80):
poz = poz + 0.04
if val in range(80, 100):
poz = poz + 0.1
return poz
print(get_battery_wear(0, 50)) # => 0.5
print(get_battery_wear(20, 35)) # => 0.15
print(get_battery_wear(50, 80)) # => 0.04 * 3 = 1.2
print(get_battery_wear(60, 80)) # => 0.04 * 2 = 0.8
print(get_battery_wear(80, 100)) # => 0.1 * 2 = 2.0
print(get_battery_wear(0,100)) # => 3.7