from calendar import monthrange, weekday
y = int(input('input year: '))
m = int(input('input month: '))
w = ' Mo Tu We Th Fr Sa Su'
D = monthrange(y, m)[1] # last day of the month
F = weekday(y, m, 1)
s = ' ' * (F+1) + ' '.join(map(str,range(1, 10))) + ' ' + ' '.join(map(str,range(10, D+1)))
print(w, end='')
for i, e in enumerate(s):
print(e, end='\n' if i % len(w) == 0 or (i+1) == len(s) else '')
日付計算を自力で作るべきではないが、曜日暗算法であるコンウェイのドゥームズデイ法則を実装
def isleap(year):
return (year%4==0 and year%100!=0) or year%400==0
def anchorday(year):
return (2, 0, 5, 3)[year // 100 % 4]
def doomsday(year):
year2 = year % 100
tmp = (year2 + year2 % 2 * 11) // 2
return (7 - (tmp + tmp % 2 * 11) + anchorday(year)) % 7
def weekday_month1st(year, month):
dates = {1:3, 2:28, 3:14, 4:4, 5:9, 6:6, 7:11, 8:8, 9:5, 10:10, 11:7, 12:12}
if isleap(year):
dates[1] += 1
dates[2] += 1
delta = 1 - dates[month]
return (doomsday(year) + delta) % 7
def len_month(year, month):
n_days = {1:31, 2:28, 3:31, 4:30, 5:31, 6:30, 7:31, 8:31, 9:30, 10:31, 11:30, 12:31}
if isleap(year):
n_days[2] += 1
return n_days[month]
y = int(input('input year: '))
m = max(int(input('input month: ')) % 13, 1)
days = [0] * weekday_month1st(y, m) + [i+1 for i in range(len_month(y, m))]
grid = [days[row:row+7] for row in range(0, len(days), 7)]
styler = lambda x: f"{x: >2}" if 0 < x else " "
print("Su Mo Tu We Th Fr Sa")
print('\n'.join(' '.join(styler(date) for date in row) for row in grid))