mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
f438440ac5
* Added doctest and more explanation about Dijkstra execution. * tests were not passing with python2 due to missing __init__.py file at number_theory folder * Removed the dot at the beginning of the imported modules names because 'python3 -m doctest -v data_structures/hashing/*.py' and 'python3 -m doctest -v data_structures/stacks/*.py' were failing not finding hash_table.py and stack.py modules. * Moved global code to main scope and added doctest for project euler problems 1 to 14. * Added test case for negative input. * Changed N variable to do not use end of line scape because in case there is a space after it the script will break making it much more error prone. * Added problems description and doctests to the ones that were missing. Limited line length to 79 and executed python black over all scripts. * Changed the way files are loaded to support pytest call. * Added __init__.py to problems to make them modules and allow pytest execution. * Added project_euler folder to test units execution * Changed 'os.path.split(os.path.realpath(__file__))' to 'os.path.dirname()' * Added Burrows-Wheeler transform algorithm. * Added changes suggested by cclauss * Fixes for issue 'Fix the LGTM issues #1024'. * Added doctest for different parameter types and negative values. * Fixed doctest issue added at last commit.
65 lines
1.5 KiB
Python
65 lines
1.5 KiB
Python
"""
|
|
Counting Sundays
|
|
Problem 19
|
|
|
|
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)?
|
|
"""
|
|
|
|
|
|
def solution():
|
|
"""Returns the number of mondays that fall on the first of the month during
|
|
the twentieth century (1 Jan 1901 to 31 Dec 2000)?
|
|
|
|
>>> solution()
|
|
171
|
|
"""
|
|
days_per_month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
|
|
|
|
day = 6
|
|
month = 1
|
|
year = 1901
|
|
|
|
sundays = 0
|
|
|
|
while year < 2001:
|
|
day += 7
|
|
|
|
if (year % 4 == 0 and not year % 100 == 0) or (year % 400 == 0):
|
|
if day > days_per_month[month - 1] and month != 2:
|
|
month += 1
|
|
day = day - days_per_month[month - 2]
|
|
elif day > 29 and month == 2:
|
|
month += 1
|
|
day = day - 29
|
|
else:
|
|
if day > days_per_month[month - 1]:
|
|
month += 1
|
|
day = day - days_per_month[month - 2]
|
|
|
|
if month > 12:
|
|
year += 1
|
|
month = 1
|
|
|
|
if year < 2001 and day == 1:
|
|
sundays += 1
|
|
return sundays
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution())
|