Статья Автор: Лебедев Дмитрий Алексеевич

Тренажер, Блок 3+

def pi(p):
  a = [p+8, p*2]
  b = set()
  for p in a:
    if p < ee[0] :b.add(p)
    elif p >= ee[1] :b.add(ee[1])
    else : b.add(ee[0]) 
  return b  
def shag (t):
  if t%2 == 1 : return set([p for p in G if pi(p)& L])
  return set([p for p in G if pi(p) <= W])
ee = [89, 99]
G = set(range(1,ee[0]))
L, W = set([ee[0]]), set([ee[1]])
for t in range(1,7):
  R = shag(t)
  if t %2 == 1 : W= W.union(R)
  if t %2 == 0 : L= L.union(R)
  G = G - R
  print(t, sorted(R))

ee=[50, 54, 6]
def pi (p):
  x, y = p
  a = [(x+1, y),(x, y+1),(x*2, y),(x, y*2)]
  b = set()
  for x, y in a :
    if x+ y < ee[0] : b.add((x,y))
    elif x+ y > ee[1] : b.add(ee[1])
    else : b.add(ee[0])
  return b
def shag(t) :
    if t%2 == 1 : return set([p for p in G if pi(p) & L])
    return set([p for p in G if pi(p) <= W])
    
L, W = set([ee[0]]), set([ee[1]])
G = set((x,y) for x in range(1, ee[0]) for y in range(1, ee[0]) if x+y < ee[0])
St =set((x,y) for x in [ee[2]] for y in range(1, ee[0]) if x+y < ee[0]) 
for t in range(1,7):
  R = shag(t)
  if t%2 == 1 : W= W.union(R)
  if t%2 == 0 : L= L.union(R)
  G = G - R
  if t > 1 : print(t, sorted(R& St))

ee=[65, 54, 6]
def pi (p):
  x, y = p
  a = [(x+1, y),(x, y+1),(x*2, y),(x, y*2)]
  b = set()
  for x, y in a :
    if x+ y < ee[0] : b.add((x,y))
    #elif x+ y > ee[1] : b.add(ee[1])
    else : b.add(ee[0])
  return b
def shag(t) :
    if t%2 == 1 : return set([p for p in G if pi(p) & L])
    return set([p for p in G if pi(p) <= W])
    
L, W = set([ee[0]]), set() #set([ee[1]])
G = set((x,y) for x in range(1, ee[0]) for y in range(1, ee[0]) if x+y < ee[0])
St =set((x,y) for x in [ee[2]] for y in range(1, ee[0]) if x+y < ee[0]) 
for t in range(1,17):
  R = shag(t)
  if t%2 == 1 : W= W.union(R)
  if t%2 == 0 : L= L.union(R)
  G = G - R
  if t > 0 : print(t, sorted(R& St))

ee=[1159, 54, 9]
def pi (p):
  x, y = p
  a = [(x+1, y),(x, y+1),(x*2, y),(x, y*2)]
  b = set()
  for x, y in a :
    if x * y < ee[0] : b.add((x,y))
    #elif x+ y > ee[1] : b.add(ee[1])
    else : b.add(ee[0])
  return b
def shag(t) :
    if t%2 == 1 : return set([p for p in G if pi(p) & L])
    return set([p for p in G if pi(p) <= W])
    
L, W = set([ee[0]]), set() #set([ee[1]])
G = set((x,y) for x in range(1, ee[0]) for y in range(1, ee[0]) if x*y < ee[0])
St =set((x,y) for x in [ee[2]] for y in range(1, ee[0]) if x*y < ee[0]) 
for t in range(1,7):
  R = shag(t)
  if t%2 == 1 : W= W.union(R)
  if t%2 == 0 : L= L.union(R)
  G = G - R
  if t > 0 : print(t, sorted(R& St)[:5])

Печать