← Back to List

23687번: Kaučuk ↗

Solutions

Python 3
1.1 KB | 1138 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta

SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "

if SET_RECURSION:
    sys.setrecursionlimit(RECURSION_LIMIT)

inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print

def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)

def solve():
    n = ii()

    l = [isplit() for _ in range(n)]

    crt = [0, 0, 0]

    for category, title in l:
        if category == "section":
            crt = [crt[0] + 1, 0, 0]
            p(crt[0], title)
        elif category == "subsection":
            crt[1] += 1
            crt[2] = 0
            p(f"{crt[0]}.{crt[1]}", title)
        else:
            crt[2] += 1
            p(f"{crt[0]}.{crt[1]}.{crt[2]}", title)

if __name__ == "__main__":
    tc = 1
    for t in range(1, tc+1):
        ret = solve()