Python Tasks & ML | Задачи по питону и машинному обучению

d = {"a": 2, "b": 3, "c": 2}
s = zip(d.values(), d.keys())
a = len([*s])
b = len([*s])
print(a, b)

from collections import OrderedDict
d = OrderedDict()
d['a'] = 0
d['b'] = 1
d['a'] = 2
s = [*d.keys()][-1]
print(s)

from sys import getsizeof
from collections import OrderedDict
d1 = dict(a1=1, b=2)
d2 = OrderedDict(a=1, b=2)
s1 = getsizeof(d1)
s2 = getsizeof(d2)

from collections import defaultdict
d = defaultdict(list)
d['a'].append(1)
d['a'].append(2)
d['b'].append(3)
sum((len(d['a']*3), len(d['b'])*5))

a = (1, 'foo')
b = (2, 'bar')
c = (2, 'z')
print(a < b, b < c)

class User:
    def __init__(self, name):
        self.name = name
a = (1, User('foo'))
b = (2, User('bar'))
c = (2, User('new'))
print(a < b, b < c)

from heapq import heappush, heappop
h = []
heappush(h, (5, 'a'))
heappush(h, (7, 'b'))
heappush(h, (3, 'c'))
print(heappop(h)[1])

from heapq import heappush, heappop
def f(iterable):
    h = []
    for value in iterable:
        heappush(h, value)
    return [heappop(h) for i in range(len(h))]
print(f([3, 5, 1]))

import sys
def f(n):
  if n == 0:
    return 1
  return n * f(n-1)  # 1
sys.setrecursionlimit(1000)  # 2 
f(50)  # 3 
sys.setrecursionlimit(1)  # 4
f(50)  # 5

recs = [(1, 2, 3), (1, 2), (3, 4), (0, 1, 2, 3, 4)]
s = 0
for a, *b in recs:
    s += sum(b)
print(s)