Counting Sundays
来源:互联网 发布:长江证券 mac 编辑:程序博客网 时间:2024/06/05 21:04
https://projecteuler.net/problem=19
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)?
简单化处理,直接从1901年往上加日期,而不是写一个函数,直接计算时间,那样有点麻烦,虽然比较通用,等问题难了的话,再写那个函数吧。
def numMonth(): count = 0 days = 366 - 31 #1900年12月1号 for i in range(1901,2001): for j in range(1,13): days += getDays(i,j - 1) #把上个月的天数加上去 if isSunday(days): count += 1 print(i,j) return countdef getDays(year,month): if month in (0,1,3,5,7,8,10): #0代表的是上一年的12月份 return 31 elif month in (4,6,9,11): return 30 elif year % 400 == 0: return 29 elif year % 4 == 0: return 29 else: return 28def isSunday(days): if days % 7 == 0: return True else: return Falseprint(numMonth())
1 0
- Counting Sundays
- Problem 19:Counting Sundays
- [projecteuler]Counting Sundays
- Euler: Counting Sundays
- PE 19 Counting Sundays
- 19 Counting Sundays - Project Euler
- Project Euler 19: Counting Sundays
- project euler 19 Counting Sundays
- Project Euler 题解 #19 Counting Sundays
- projecteuler---->problem=19----Counting Sundays
- Project Euler:Problem 19 Counting Sundays
- Problem 19 Counting Sundays (计算星期天)
- Project Euler Problem 19 Counting Sundays
- 欧拉项目 第19题 Counting Sundays
- Polya Counting
- Counting sort
- POJ_2386_Lake Counting
- Counting Sequences
- 20160305 一个ISO安装多种版本的Windows 7
- asp链接access2010数据库
- Painlessly Deploying Data Apps with Bokeh, Flask, and Heroku
- 类加载机制
- Git使用方法(Windows操作系统下)
- Counting Sundays
- 依赖倒置原则
- JS引擎工作机制描述(转载)
- POJ 1837 Balance
- gdkoi2016记
- JS操作cookie
- 【making tools】:捕捉牡丹江医学院的网页数据
- MATLAB量化浮点数
- 求1+2+3+...+n