← Back to List

17536번: Hour for a Run ↗

Solutions

Python 3
709 B | 705 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)

BLANK = " "

# inp = input
inp = lambda : sys.stdin.readline().rstrip()
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())
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():
    v, n = mii() # v: 랩 수, n:

    for i in range(1, 10):
        z = v * n * i 
        p(z // 10 + int(z % 10 > 0), end = " ")


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