← Back to List

5089번: Travelling Salesman ↗

Solutions

Python 3
710 B | 710 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():
	tc = 0
	while 1:
		tc += 1
		n = ii()

		if n == 0:
			break
		
		ans = len(set([inp() for _ in range(n)]))

		p(f"Week {tc} {ans}")


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