>>>fin = open('words.txt')
>>>print(fin)
<open file 'words.txt',mode 'r' at 0xb7f4b380>
>>>fin.readline()
'aa\r\n'
>>>fin.readline()
'aah\r\n'

>>>fin = open(words.txt)
>>>print (fin)
<_io.TextIOWrapper name='words.txt' mode='r' encoding='cp936'>
>>>fin.readline()
'aa\n'
>>>fin.readline()
'aah\n'

>>>line = fin.readline()
>>>word = line.strip()
>>>print (word)
aahed

fin = open(words.txt)
for line in fin:word = line.strip()print(word)

letter = input('please input:')
def has_no_e(letter):if 'e' in letter:return Trueelse:return Falseprint(has_no_e(letter))

fin = open('words_1.txt')
count = 0
num = 0
for line in fin:if 'e' not in line:print (line)count += 1else:num += 1print('%.2f' % (count / (count + num)))

def is_abecedarian(word):previous = word[0]for c in word:if c < previous:return Falseprevious = creturn True

def is_abecedarian(word):if len(word) <= 1:return Trueif word[0] > word[1]:return Falsereturn is_abecedarian(word[1:])

def is_abecedarian(word):i = 0while i < len(word) - 1:if word[i+1] < word[i]:return Falsei += 1return True

fin = open('words.txt')def is_answer(fin):for line in fin:i = 0while len(line) >= 6 and len(line) - i >= 6:if line[i] == line[i+1] and line[i+2] == line[i+3] and line[i+4] == line[i+5]:return lineelse:i += 1print(is_answer(fin))

def is_triple_double(word):"""Tests if a word contains three consecutive double letters."""i = 0count = 0while i < len(word)-1:if word[i] == word[i+1]:count = count + 1if count == 3:return Truei = i + 2else:count = 0i = i + 1return Falsedef find_triple_double():"""Reads a word list and prints words with triple double letters."""fin = open('words.txt')for line in fin:word = line.strip()if is_triple_double(word):print wordprint 'Here are all the words in the list that have'
print 'three consecutive double letters.'
find_triple_double()
print ''

# exercise 9.8
'''首先定义一个回文判定函数'''
def is_huiwen(i):if i[::-1] == i:print (i)def is_answer():   i = 100000while i <= 999999:# for i in range(100000,999999):a = str(i)a = a[2:]b = str(i+1)b = b[1:]c = str(i+2)c = c[2:]d = str(i+3)return (is_huiwen(a) andis_huiwen(b) andis_huiwen(c) andis_huiwen(d))i += 1print(is_answer())
#没有输出结果，不知道原因是什么？

def has_palindrome(i, start, len):s = str(i)[start:start+len]return s[::-1] == sdef check(i):return (has_palindrome(i, 2, 4)   andhas_palindrome(i+1, 1, 5) andhas_palindrome(i+2, 1, 4) andhas_palindrome(i+3, 0, 6))def check_all():i = 100000while i <= 999996:if check(i):print (i)i = i + 1print ('The following are the possible odometer readings:')
print (check_all())

>>> b"42".zfill(5)
b'00042'
>>> b"-42".zfill(5)
b'-0042'

def str_fill(i, len):return str(i).zfill(len)def are_reversed(i, j):return str_fill(i,2) == str_fill(j,2)[::-1]def num_instances(diff, flag=False):daughter = 0count = 0while True:mother = daughter + diffif are_reversed(daughter, mother) or are_reversed(daughter, mother+1):count = count + 1if flag:print (daughter, mother)if mother > 120:breakdaughter = daughter + 1return countdef check_diffs():diff = 10while diff < 70:n = num_instances(diff)if n > 0:print (diff, n)diff = diff + 1print ('diff  #instances')
check_diffs()print
print ('daughter  mother')
num_instances(18, True)