Разбор демоверсии ЕГЭ 2027
Информатика

values = []
for n in range(1, 26):
    b = bin(n)[2:]
    r = int('11' + b + '11' if n % 2 == 0 else '1' + b + '00', 2)
    if r > 95:
        values.append(r)
print(min(values))

count = sum(len(set(row)) == 5 and 3*(min(row)+max(row)) > sum(row)
            for row in rows)
print(count)

import re
count = len(re.findall(r'(?<![А-Яа-яЁё])и(?![А-Яа-яЁё])', chapter, re.I))
print(count)

a = list(map(int, open('demo_17.txt').read().split()))
m = min(a)
sums = [x+y for x,y in zip(a,a[1:]) if x % 33 == m or y % 33 == m]
print(len(sums), max(sums))

from functools import lru_cache
def moves(a,b):
    return [(a+4,b),(a,b+4),(2*a,b),(a,2*b)]
@lru_cache(None)
def game(a,b):
    if a+b >= 133:
        return 0
    values = [game(*p) for p in moves(a,b)]
    wins = [v for v in values if v <= 0]
    return 1-max(wins) if wins else -max(values)
print([s for s in range(1,116) if game(17,s) == 2][:2])

from functools import lru_cache
def moves(a,b):
    return [(a+4,b),(a,b+4),(2*a,b),(a,2*b)]
@lru_cache(None)
def game(a,b):
    if a+b >= 133:
        return 0
    values = [game(*p) for p in moves(a,b)]
    wins = [v for v in values if v <= 0]
    return 1-max(wins) if wins else -max(values)
print(min(s for s in range(1,116) if game(17,s) == -2))

ways = {100: 1}
for n in range(100, 141):
    ways[n+1] = ways.get(n+1,0) + ways.get(n,0)
    t,u = n//10%10, n%10
    if t < u:
        m = n//100*100 + 10*u + t
        if m <= 141:
            ways[m] = ways.get(m,0) + ways.get(n,0)
print(ways[141])

import re
s = open('demo_24.txt').read().strip()
number = r'(?:0|[6789][06789]*)'
pattern = re.compile(number + r'(?:[-*]' + number + r')*')
print(max(len(m.group()) for m in pattern.finditer(s)))

from collections import defaultdict
with open('demo_26.txt') as f:
    n,k = map(int,f.readline().split())
    rows = [(t,int(c),int(s)) for t,c,s in (line.split() for line in f)]
rows.sort(key=lambda r:r[0])
total = defaultdict(int)
used = 0
backups = []
for t,client,size in rows:
    total[client] += size
    if used + size > k:
        if t <= '11:59:59':
            backups.append(used)
        used = 0
    used += size
print(max(total,key=total.get), sum(sorted(backups,reverse=True)[:2]))