Skip to main content

Problem 19 Project Euler solution with python

Counting Sundays

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)?

 To solve this problem I have used inbuilt calendar module.
I will first explain some code before we will solve the problem.

 Calendar module is a inbuilt module in python with which you can perform all the calculations related to  days, year, months etc.
In calendar module days(days of week) are represented in number format.
They are as follows:
0 - Monday
1 - Tuesday
2 - Wednesday
3 - Thursday
4 - Friday
5 - Saturday
6 - Sunday

 This module by default assumes that the week starts with Monday.To use calendar module, you first have to import it.

>>> import calendar
>>>
To change the start of week from Monday to Sunday we do as follows:

>>> calendar.setfirstweekday(6)#6-Sunday
>>>
To check the first week day:

>>> calendar.firstweekday()
6
>>>
To print calendar for a year:

>>> calendar.prcal(2016)
The output will be as follows:
2016 calendar generated using python
Printing calender for a specified month:
>>> calendar.prmonth(2016,4)
Output will look something like this:
April 2016 Calendar generated using python
April 2016 Calendar generated using python
Till now we have seen the calenders in a neat human readable format. But for our computation these are not useful, we will have to use matrices. To generate a months calender in a matrix form then(For April 2016):

>>> calendar.monthcalendar(2016,4)
Matrix generated by above code will be as follows:
[[0, 0, 0, 0, 0, 1, 2], [3, 4, 5, 6, 7, 8, 9], [10, 11, 12, 13, 14, 15, 16], [17, 18, 19, 20, 21, 22, 23], [24, 25, 26, 27, 28, 29, 30]]
Consider the first list in the list generated above. If we write the above in a human readable calendar format then it will look something like this:
April
Su Mo Tu We Th Fr Sa
0 0 0 0 0 1 2
As you have seen, if in the first list the first number(index 0) is 1 then the month has started with Sunday.
This is the concept behind our program. This may look complicated but is very simple. Try to understand it. If you haven't understood it then read this post again or you can see the official documentation. 

Program 

Program using the above concept is as follows:
It will be very simple once you have understood the above concept or algorithm whatever you call it.
You can download the above program from Github Gist pep19.py.

Output

Summary

I think this problem is easy if you knew calendar module. Once I understood the calender module, it just took me a few minutes to solve this problem.

 I have not explained any code because the code is well commented and also it is easy once you understand the concept behind it. If you haven't understood anything comment in the comment box below and I will be glad to help you.

 Please don't hesitate to comment if you have found any typo or have a different/better code.

 You can also contact me .

 Thank you. Have a nice day.
Labels:

Popular posts from this blog

Making a quiz web app with python and flask

Edit : When you are creating a web app with h tml templates, then y ou will have to sa ve the html file in templates folder in the Current Wor ki ng Directory( CWD). If you save the file in the C W D directl y you will get a TemplateNotFound error. Thank you Udhay for pointing it out.   In this post we will create a quiz website using python . I will be using the flask framework . After reading this tutorial you will learn form submission , flask templates , python code in flask templates , shuffling the questions and options with the random module and few others.  Please note that this tutorial is not big as it seems to be. Some of the code has been rewritten to maintain consistency and also font size is somewhat big so that your eyes won't get stressed reading this tutorial. Also the content has not occupied the full width of the page. In this tutorial I am assuming that you are having a very basic understanding of the flask framework . Please refer the documentation
Read more

Problem 11 Project Euler Solution with python

Largest product in a grid In the 20×20 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 04 52 08 83 97 35 99 16 07
Read more

Problem 60 Project Euler Solution with python

Prime pair sets The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property. Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime. This problem is j u st a brute force problem. If you have come here because you don't know the limit upto which you will h ave to gener ate the prime numbers t hen go ahe ad and t r y with 10,000 . When I first start ed solving the problem I chose 1 million(beca use most of the problem s on project E uler have this limit ), but it took very long for the computer to fin d the solution. After searching on the internet then I found many people choosing 10, 000 so I have changed my in put f rom 1 million to 10000 and the output was f ast. He
Read more