프로그래밍_일반/백준
boj 2948
Spadework
2020. 3. 16. 08:28
* Solved 기준 브론즈2 단순 풀이
y = [31,28,31,30,31,30,31,31,30,31,30,31]
w = ['Thursday','Friday','Saturday','Sunday','Monday','Tuesday','Wednesday']
d,m = map(int, input().split()); d += sum(y[0:m-1])-1
print(w[d%7])