import datetime, calendar

today = datetime.date.today()
oneday = datetime.timedelta(days=1)

# loop back to most recent Friday (could be today)
# takes care of end of month and even leap years

friday = today
while friday.weekday() != calendar.FRIDAY:
	friday -=oneday

oneweek = datetime.timedelta(days=7)
nextweek = today + oneweek
nextyear = today.replace(year=today.year+1)

print "Today (year-month-day) = ", today
print "Most recent Friday = ", friday
print "One week from today = ", nextweek
print "One year from today = ", nextyear
print "Current time = ", datetime.datetime.now().time() # just the time
print "Lunchtime = ", datetime.time(12,00) #12:00:00

print '-'*50

# a typical birthday year, month, day
birthday = datetime.date(1977,4,27)
# three diffeerent ways to present a date
# 1977-04-27
print "Birthday format1: ", birthday
# 04/27/77
print "Birthday format2: ", birthday.strftime("%m/%d/%y")
# 01Apr1977
print "Birthday format3: ", birthday.strftime("%d %b %Y")

age = today - birthday
print "You are ", age.days, "days old today!"

# extract the year from todays date
thisyear = int(today.strftime("%Y")[0:4])

# party message (include date and time)
rightnow = datetime.datetime.today()
bparty = datetime.datetime(thisyear, 4, 27, 14, 30)
# check if you can still make it to the party ...
if bparty > rightnow:
	print "Birthday party", bparty
else:
	print "Mised this year's birthday party!"

print '-'*50

# calculate days till xmas of this year
xmas = datetime.date(thisyear, 12, 25)
tillXmas = xmas - today
print "There aere %d days till xmas!" % tillXmas.days

print '-'*50

# add days to a given date
delta = datetime.timedelta(days=77)
addDays = today + delta
print "Today 's date is 			 :", today.strftime("%d%b%Y")
print "77 days from today it will be :", addDays.strftime("%d%b%Y")

print '-'*50

Weekday = ['Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 
	'Saturday', 'Sunday']

print "Today is ", Weekday[datetime.date.weekday(today)]

• 北京: 千橡集团暨校内网诚聘软件研发工程师
• 搜狐网站诚聘Java、PHP和C++工程师

# -*- coding: UTF-8 -*-
#递归算法
def recursion(n):
	if (n<1):
		return 0
	elif (n<3):
		return 1
	else:
		return recursion(n-1)+recursion(n-2)

#循环算法
def loop(n):
	print 1,1,
	a,b = 1,2
	i = 2
	while i <= n:
		print b,
		a,b = b, a+b
		i += 1
	

if __name__=="__main__":
	print "递归算法"
	for i in range(1,16):
		print recursion(i),
	print "\n"+'-'*50
	
	print "迭代法"
	loop(14)

• 北京: 千橡集团暨校内网诚聘软件研发工程师
• 搜狐网站诚聘Java、PHP和C++工程师

• 北京: 千橡集团暨校内网诚聘软件研发工程师
• 搜狐网站诚聘Java、PHP和C++工程师