← Back to List

27001번: Bovine Birthday ↗

Solutions

Python 3
772 B | 772 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():
    y, m, d = mii()

    tm = datetime(year = y, month = m, day = d)

    day = tm.weekday()
    l = ["monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday"]
    p(l[day])


if __name__ == "__main__":
    tc = 1

    for t in range(1, tc+1):
        ret = solve()