Python Challenge游戏攻略(二)

6.python的zip

图为拉链:拉链的英文为:zip,联想网址修改为:http://www.pythonchallenge.com/pc/def/channel.zip
会下载下来一个chaanel.zip的文件,解压出来有一个readme文档:

welcome to my zipped list.
hint1: start from 90052   暗示1:从90052开始
hint2: answer is inside the zip    暗示2:答案在zip里面

写代码解析


first_file = open(“e:/python games/channel/90052.txt”) route = “e:/python games/channel/” def get_next(id): route = “e:/python games/channel/” new_route = route + id + “.txt” file_= open(new_route) b = file_.readlines()[0].split(” is “)[1] print(b) return b id = “90052” for i in range(910): id = get_next(id)

得到 46145
里面的内容为:Collect the comments.

import zipfile, StringIO,traceback
z = zipfile.ZipFile(“e:/python games/channel/channel.zip”)
def get_next(p):
    route = “e:/python games/channel/”
    new_route = route + p + “.txt”
    file_= open(new_route)
    b = file_.readlines()[0].split(” is “)[1]
    return b
p = “90052”
zpp = []
for i in range(len(z.namelist())):
    try:
        zpp.append(p)
        p = get_next(p)
    except:
        print(zpp)
        print ”.join([z.getinfo(‘%s.txt’ % p).comment for p in zpp])

得到:

http://www.pythonchallenge.com/pc/def/hockey.html
it’s in the air. look at the letters.
其实是oxygen 氧气,在空气中

7.image处理

he clue is “smarty”, and there’s a picture with a strip of greyscale squares across the middle. Maybe the answer is encoded in those greyscale squares, with the greyscale level (running from 0–255) encoding a character in ASCII? Let’s try it.

>>> import Image
>>> def get_image(s): return Image.open(StringIO.StringIO(get_challenge(s)))
...
>>> im = get_image('def/oxygen.png')
>>> w,h = im.size
>>> im.getpixel((0,h//2))
(115, 115, 115, 255)
>>> chr(115)
's'
Looks plausible. Let’s guess that each block is 8 pixels wide:

>>> print ''.join([chr(im.getpixel((i, h//2))[0]) for i in range(0,w,8)])
smartguy, yo made i. the nxt leve is [10, 110, 16, 101 103, 14, 105,116, 12]reb
Oops, so near but not quite there. Closer examination reveals that the colour changes every 7 pixels.

>>> print ''.join([chr(im.getpixel((i, h//2))[0]) for i in range(0,w,7)])
smart guy, you made it. the next level is [105, 110, 116, 101, 103, 114, 105, 116, 121]pe_
>>> print ''.join(map(chr, [105, 110, 116, 101, 103, 114, 105, 116, 121]))
integrity

8.intergrity

点击图片会有一个登陆验证:找到网页源码中的一段隐藏代码

<!–
un: ‘BZh91AY&SYA\xaf\x82\r\x00\x00\x01\x01\x80\x02\xc0\x02\x00 \x00!\x9ah3M\x07<]\xc9\x14\xe1BA\x06\xbe\x084’
pw: ‘BZh91AY&SY\x94$|\x0e\x00\x00\x00\x81\x00\x03$ \x00!\x9ah3M\x13<]\xc9\x14\xe1BBP\x91\xf08’
–>

采用的是BZ2压缩文件,python bz2压缩

# coding:utf-8
import bz2
a = ‘BZh91AY&SYA\xaf\x82\r\x00\x00\x01\x01\x80\x02\xc0\x02\x00 \x00!\x9ah3M\x07<]\xc9\x14\xe1BA\x06\xbe\x084’
b = ‘BZh91AY&SY\x94$|\x0e\x00\x00\x00\x81\x00\x03$ \x00!\x9ah3M\x13<]\xc9\x14\xe1BBP\x91\xf08’
U = bz2.BZ2Decompressor().decompress(a)
p = bz2.BZ2Decompressor().decompress(b)
print(U,p)
答案
(‘huge’, ‘file’)
输入登录框,done

做完第8题会有小福利:

<!–
To see the solutions to the previous level, replace pc with pcc and add :un:pw
i.e. go to: http://www.pythonchallenge.com/pcc/return/good.html:huge:file
Join us at the IRC: irc.freenode.net #pythonchallenge
–>
可以查看官方给出的解法,但只是这一题有权限

9.坐标系

<!–
first+second=?
first:
146,399,163,403,170,393,169,391,166,386,170,381,170,371,170,355,169,346,167,335,170,329,170,320,170,
310,171,301,173,290,178,289,182,287,188,286,190,286,192,291,194,296,195,305,194,307,191,312,190,316,
190,321,192,331,193,338,196,341,197,346,199,352,198,360,197,366,197,373,196,380,197,383,196,387,192,
389,191,392,190,396,189,400,194,401,201,402,208,403,213,402,216,401,219,397,219,393,216,390,215,385,
215,379,213,373,213,365,212,360,210,353,210,347,212,338,213,329,214,319,215,311,215,306,216,296,218,
290,221,283,225,282,233,284,238,287,243,290,250,291,255,294,261,293,265,291,271,291,273,289,278,287,
279,285,281,280,284,278,284,276,287,277,289,283,291,286,294,291,296,295,299,300,301,304,304,320,305,
327,306,332,307,341,306,349,303,354,301,364,301,371,297,375,292,384,291,386,302,393,324,391,333,387,
328,375,329,367,329,353,330,341,331,328,336,319,338,310,341,304,341,285,341,278,343,269,344,262,346,
259,346,251,349,259,349,264,349,273,349,280,349,288,349,295,349,298,354,293,356,286,354,279,352,268,
352,257,351,249,350,234,351,211,352,197,354,185,353,171,351,154,348,147,342,137,339,132,330,122,327,
120,314,116,304,117,293,118,284,118,281,122,275,128,265,129,257,131,244,133,239,134,228,136,221,137,
214,138,209,135,201,132,192,130,184,131,175,129,170,131,159,134,157,134,160,130,170,125,176,114,176,
102,173,103,172,108,171,111,163,115,156,116,149,117,142,116,136,115,129,115,124,115,120,115,115,117,
113,120,109,122,102,122,100,121,95,121,89,115,87,110,82,109,84,118,89,123,93,129,100,130,108,132,110,
133,110,136,107,138,105,140,95,138,86,141,79,149,77,155,81,162,90,165,97,167,99,171,109,171,107,161,
111,156,113,170,115,185,118,208,117,223,121,239,128,251,133,259,136,266,139,276,143,290,148,310,151,
332,155,348,156,353,153,366,149,379,147,394,146,399
second:
156,141,165,135,169,131,176,130,187,134,191,140,191,146,186,150,179,155,175,157,168,157,163,157,159,
157,158,164,159,175,159,181,157,191,154,197,153,205,153,210,152,212,147,215,146,218,143,220,132,220,
125,217,119,209,116,196,115,185,114,172,114,167,112,161,109,165,107,170,99,171,97,167,89,164,81,162,
77,155,81,148,87,140,96,138,105,141,110,136,111,126,113,129,118,117,128,114,137,115,146,114,155,115,
158,121,157,128,156,134,157,136,156,136
加法?
提示是:提示:connect the dots
>>> first = [146,399,…] 
>>> len(first), min(first), max(first) (442, 77, 403) 
>>> second = [156,141,…] 
>>> len(second), min(second), max(second) (112, 77, 220)

# 两个list(x,y轴)的长度不同,看起来不是横纵坐标
#  也许是first内部就是自己的横纵坐标,然后划出两条线
[x0, y0, x1, y1, …].

用到python的image模块
image的普通用法:http://blog.sina.com.cn/s/blog_523491650100gyin.html
imagedraw:http://blog.csdn.net/icamera0/article/details/50747084

im = Image.new(‘1’, (500,500), 1)
draw = ImageDraw.Draw(im)
print(zip(a[0::2], a[1::2]))
draw.line(zip(a[0::2], a[1::2]))
draw.line(zip(c[0::2], c[1::2]))
im.save(‘first+second.png’)
cow?
no,it’s bull,公牛
http://www.pythonchallenge.com/pc/return/bull.html

10.len

<map name=”bull”>
<area shape=”poly” coords=”146,399,163,403,170,393,169,391,166,386,170,381,170,371,170,355,169,346,167,335,170,329,170,320,170,310,171,301,173,290,178,289,182,287,188,286,190,286,192,291,194,296,195,305,194,307,191,312,190,316,190,321,192,331,193,338,196,341,197,346,199,352,198,360,197,366,197,373,196,380,197,383,196,387,192,389,191,392,190,396,189,400,194,401,201,402,208,403,213,402,216,401,219,397,219,393,216,390,215,385,215,379,213,373,213,365,212,360,210,353,210,347,212,338,213,329,214,319,215,311,215,306,216,296,218,290,221,283,225,282,233,284,238,287,243,290,250,291,255,294,261,293,265,291,271,291,273,289,278,287,279,285,281,280,284,278,284,276,287,277,289,283,291,286,294,291,296,295,299,300,301,304,304,320,305,327,306,332,307,341,306,349,303,354,301,364,301,371,297,375,292,384,291,386,302,393,324,391,333,387,328,375,329,367,329,353,330,341,331,328,336,319,338,310,341,304,341,285,341,278,343,269,344,262,346,259,346,251,349,259,349,264,349,273,349,280,349,288,349,295,349,298,354,293,356,286,354,279,352,268,352,257,351,249,350,234,351,211,352,197,354,185,353,171,351,154,348,147,342,137,339,132,330,122,327,120,314,116,304,117,293,118,284,118,281,122,275,128,265,129,257,131,244,133,239,134,228,136,221,137,214,138,209,135,201,132,192,130,184,131,175,129,170,131,159,134,157,134,160,130,170,125,176,114,176,102,173,103,172,108,171,111,163,115,156,116,149,117,142,116,136,115,129,115,124,115,120,115,115,117,113,120,109,122,102,122,100,121,95,121,89,115,87,110,82,109,84,118,89,123,93,129,100,130,108,132,110,133,110,136,107,138,105,140,95,138,86,141,79,149,77,155,81,162,90,165,97,167,99,171,109,171,107,161,111,156,113,170,115,185,118,208,117,223,121,239,128,251,133,259,136,266,139,276,143,290,148,310,151,332,155,348,156,353,153,366,149,379,147,394,146,399″ href=”sequence.txt”>
</map>
href=”sequence.txt”:
a = [1, 11, 21, 1211, 111221,
http://www.pythonchallenge.com/pc/return/sequence.txt
a = [1, 11, 21, 1211, 111221,
len(a[30]) = ?

其实找到了个很诡异的规律,但是和官方的不一样。官方的规律是这样的:
1
1个1,写作11
2个1,写作21
1个2,1个1,写作1211
……
最后算一下就出来了5808

Written by

说点什么

欢迎讨论

avatar

此站点使用Akismet来减少垃圾评论。了解我们如何处理您的评论数据

  Subscribe  
提醒