44 lines
1.1 KiB
Python
44 lines
1.1 KiB
Python
#!/usr/bin/env python3
|
|
"""
|
|
Created on 15 Sep 2018
|
|
|
|
@author: David Doblas Jiménez
|
|
@email: daviddoji@pm.me
|
|
|
|
Solution for problem 19 of Project Euler
|
|
https://projecteuler.net/problem=19
|
|
"""
|
|
|
|
from datetime import date
|
|
from utils import timeit
|
|
|
|
|
|
@timeit("Problem 19")
|
|
def compute():
|
|
"""
|
|
You are given the following information, but you may prefer to do some
|
|
research for yourself.
|
|
|
|
1 Jan 1900 was a Monday.
|
|
Thirty days has September, April, June and November.
|
|
All the rest have thirty-one,
|
|
Saving February alone,
|
|
Which has twenty-eight, rain or shine.
|
|
And on leap years, twenty-nine.
|
|
A leap year occurs on any year evenly divisible by 4, but not on a century
|
|
unless it is divisible by 400.
|
|
|
|
How many Sundays fell on the first of the month during the twentieth
|
|
century (1 Jan 1901 to 31 Dec 2000)?
|
|
"""
|
|
sundays = 0
|
|
for y in range(1901, 2001):
|
|
for m in range (1, 13):
|
|
if date(y, m, 1).weekday() == 6:
|
|
sundays += 1
|
|
return sundays
|
|
|
|
|
|
if __name__ == "__main__":
|
|
|
|
print(f"Result for Problem 19: {compute()}") |