Pythonchallenge一起来闯关
http://www.pythonchallenge.com/是一个在线的python过关游戏,一共有33关.玩这个游戏对熟悉python用法及相关库的使用都很有好处.
目前做到了第九关.python版本3.4. 操作系统版本32位win7,64位win7.
0.http://www.pythonchallenge.com/pc/def/0.html
计算2的38次方
1.http://www.pythonchallenge.com/pc/def/274877906944.html
提示已经很清楚了,简单的字符转换.可以使用str模块中的maketrans()和translate()方法.https://docs.python.org/3/library/stdtypes.html#str.translate
2.http://www.pythonchallenge.com/pc/def/ocr.html
页面源码里有注释:
<!-- | |
find rare characters in the mess below: | |
--> |
用到了re模块,这里有很好的关于re模块的使用说明,我觉得比官方文档要好读一些http://www.cnblogs.com/huxi/archive/2010/07/04/1771073.html
import urllib.request as ur
import re url = "http://www.pythonchallenge.com/pc/def/ocr.html" def main():
global url response = ur.urlopen(url)
body = response.read() text = re.search("<!--\n%(.|\s)+",body.decode())
dic={}
#print(text.group(0))
for x in text.group(0):
if x not in dic:
dic[x] = 1
else:
dic[x] += 1 print(dic)
for i in dic:
if (dic[i]== 1 and 'a' <= i <='z'):
print(i) if __name__ == '__main__':
main()
3.http://www.pythonchallenge.com/pc/def/equality.html
提示:One small letter, surrounded by EXACTLY three big bodyguards on each of its sides.
import urllib.request as ur
import re url = "http://www.pythonchallenge.com/pc/def/equality.html" def main():
response = ur.urlopen(url)
body = response.read() pattern="[^A-Z][A-Z][A-Z][A-Z]([a-z])[A-Z][A-Z][A-Z][^A-Z]" result = re.findall(pattern,body.decode())
print(result) if __name__ == '__main__':
main()
4.http://www.pythonchallenge.com/pc/def/linkedlist.php
查看页面源代码,可以看到提示有follow the chain,又有一个href,点击之后页面显示“next nothing is ....”猜想是不断地访问下一个url直到答案出现.
re.match()
checks for a match only at the beginning of the string, while re.search()
checks for a match anywhere in the string (this is what Perl does by default).import urllib.request as ur
import re url = "http://www.pythonchallenge.com/pc/def/linkedlist.php?nothing=8022" def main():
global url
global body
while 1:
print(url)
response = ur.urlopen(url)
#print(type(response)) body = response.read()
#print(type(body))
#print(body)
#print(body.decode()) pattern="and the next nothing is ([0-9]+)"
#match从string的开头查找
#search从string的anywhere开始找
result = re.search(pattern,body.decode())
#print(result)
#m=re.match(r'and the next nothing is ([0-9]+)', body)
#print(m)
if result:
num = result.group(1)
print(result.group(0))
print(num)
url = "http://www.pythonchallenge.com/pc/def/linkedlist.php?nothing=%s" % num
else:
#print(type(result),result)
break
print(body) if __name__ == '__main__':
main()
5.http://www.pythonchallenge.com/pc/def/peak.html
import urllib.request as ur
import pickle url = "http://www.pythonchallenge.com/pc/def/banner.p" def main():
global url httpresponse = ur.urlopen(url)
dataBytes = httpresponse.read() obj = pickle.loads(dataBytes)
#print(type(obj),obj)
for ele in obj:
#print(ele)
s=""
for i in ele:
#print(i)
#print(i[0]*i[1])
s += i[0]*i[1]
print(s) if __name__ == '__main__':
main()
6.http://www.pythonchallenge.com/pc/def/channel.html
import urllib.request as ur
import zipfile
import pathlib
import re url = "http://www.pythonchallenge.com/pc/def/channel.zip" def main():
# global url #下载zip文件并解压
# httpresponse = ur.urlopen(url)
# dataBytes = httpresponse.read()
# with open("channel.zip", "wb") as local_file:
# if local_file.write(dataBytes):
# z = zipfile.ZipFile("channel.zip")
# z.extractall("./channel") # # p = pathlib.Path("./channel")
# # for files in p.iterdir():
# # #print(files,type(files))
# # #str = open(files).read()
# # str = files.open().read()
# # print(str)
# # break; #读取解压的文档获取提示 z = zipfile.ZipFile("channel.zip")
z.extractall("./channel") orderedFilePath=[]
filepath = "./channel/90052.txt"
filename = "90052.txt"
while 1:
orderedFilePath.append(filename)
f = open(filepath)
content = f.read()
result = re.match("Next nothing is (\d+)",content)
if result:
num = result.group(1)
#print(num)
filepath = "./channel/%s.txt" % num
filename = "%s.txt" % num
else:
#print(content)
break print(orderedFilePath)
for file in orderedFilePath:
c = z.getinfo(file).comment.decode()
print(c,end="") if __name__ == '__main__':
main()
7.http://www.pythonchallenge.com/pc/def/oxygen.html
这一关要用到图形库PIL.首先PIL官方版不支持py3,其次官方版不支持64位python.一番google之后,下载http://pillow.readthedocs.org/en/latest/installation.htmlpillow代替PIL
import urllib.request as ur
from PIL import Image def ReadUrl(url):
httpresponse = ur.urlopen(url)
dataBytes = httpresponse.read() return dataBytes def main():
url = "http://www.pythonchallenge.com/pc/def/oxygen.png"
databytes = ReadUrl(url)
f = open("oxygen.png","wb")
f.write(databytes)
im = Image.open("oxygen.png")
#print(im.size)
(width,height) = im.size for i in range(0,width,1):
pos = (i,height/2)
#pixel(49,49,49,255)前三位代表的是rgb的值.
pixel = im.getpixel(pos)
#ascii码转字符
char = chr(pixel[0])
print(char,end="") print(''.join(map(chr, [105, 110, 116, 101, 103, 114, 105, 116, 121]))) if __name__ == '__main__':
main()
8.http://www.pythonchallenge.com/pc/def/integrity.html
页面源码里有一个链接,href="../return/good.html",点击之后发现要用户名和密码,恰好当前页面源码里有注释
<!-- | |
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' | |
--> |
import bz2 un=b'BZh91AY&SYA\xaf\x82\r\x00\x00\x01\x01\x80\x02\xc0\x02\x00 \x00!\x9ah3M\x07<]\xc9\x14\xe1BA\x06\xbe\x084'
pw=b'BZh91AY&SY\x94$|\x0e\x00\x00\x00\x81\x00\x03$ \x00!\x9ah3M\x13<]\xc9\x14\xe1BBP\x91\xf08' def main():
#username = bz2.decompress(un.decode("utf-8"))
username=bz2.decompress(un)
password=bz2.decompress(pw)
print(username,password) if __name__ == '__main__':
main()
9.http://www.pythonchallenge.com/pc/return/good.html
import urllib.request as ur
from PIL import Image def SaveImg(url,imgname):
httpresponse = ur.urlopen(url)
dataBytes = httpresponse.read()
f = open(imgname,"wb")
f.write(databytes)
f.close() 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] def main():
coordinates = first + second
im = Image.open("good.jpg")
w,h = im.size
mode = im.mode
bands = im.getbands()
print(type(mode),mode)
print(type(bands),bands) #两两为一个像素点位置
postions = []
for x in range(0,len(coordinates),2):
postion = (coordinates[x],coordinates[x+1])
postions.append(postion) im2 = Image.new(mode,(w,h))
for pos in postions:
im2.putpixel(pos,(255,255,255))
im2.save('09answer.jpg') if __name__ == '__main__':
main()
Pythonchallenge一起来闯关的更多相关文章
- Pythonchallenge一起来闯关(二)
前情提要:Pythonchallenge一起来闯关(一) 这一篇来闯关10-15.感觉这几关比先前的难了不少,有的题目完全没思路. 10. 页面源码中的链接点击后有a = [1, 11, 21, 12 ...
- THEPYTHONCHALLENG闯关记录
由于是自己看视频学python,总觉得不写几行代码就什么都没有学到. 找了一个写代码的网站其实只是因为这个看起来好玩. 闯关地址http://www.pythonchallenge.com/index ...
- 网页闯关游戏(riddle webgame)--H5刮刮卡的原理和实践
前言: 之前编写了一个网页闯关游戏(类似Riddle Game), 除了希望大家能够体验一下我的游戏外. 也愿意分享编写这个网页游戏过程中, 学到的一些知识. 对于刮刮卡, 想必大家都很熟悉, 也很喜 ...
- 网页闯关游戏(riddle webgame)--SQL注入的潘多拉魔盒
前言: 之前编写了一个网页闯关游戏(类似Riddle Game), 除了希望大家能够体验一下我的游戏外. 也愿意分享编写这个网页游戏过程中, 学到的一些知识. web开发初学者往往会忽视一些常见的漏洞 ...
- 网页闯关游戏(riddle webgame)--仿微信聊天的前端页面设计和难点
前言: 之前编写了一个网页闯关游戏(类似Riddle Game), 除了希望大家能够体验一下我的游戏外. 也愿意分享编写这个网页游戏过程中, 学到的一些知识. 本文讲描述, 如何在网页端实现一个仿微信 ...
- 网页闯关游戏(riddle webgame)--游戏玩法和整体介绍
前言: 记得上大学那会, 有位传说中的大牛, 写了一个网页闯关类的游戏. 当时我们玩得不亦乐乎, 也是第一次接触到这种形式的游戏. 不过当时纯玩家心态, 并没有想过去创造一个. 最近想起这事, 突然想 ...
- 《JavaScript 闯关记》
为何写作此课程 stone 主要负责基于 Web 的企业内部管理系统的开发,虽然能够熟练地使用 JavaScript,但随着对 JavaScript 的理解越来越深,才发现自己尚未掌握其精髓. 201 ...
- 淘宝ued - 前端智勇大闯关(第三季)答案(更新)
淘宝ued - 前端智勇大闯关(第三季)答案(更新) 下午在微博上看到了淘宝智勇大闯关第三季的信息,感觉挺有意思的,于是就尝试做了下.附上题目地址: http://ued.campus.alibaba ...
- 《JavaScript闯关记》视频版硬广
<JavaScript闯关记>视频版硬广 stone 在菜航工作时,兼任内部培训讲师,主要负责 JavaScript 基础培训,2016年整理的<JavaScript闯关记>课 ...
随机推荐
- 9.DataPager
ListView搭配DataPager控件实现分页.有两种使用方式:一是将DataPager声明到ListView中:一种是DataPager\ListView没有嵌套关系,然后将DataPager的 ...
- Arrays常用API的事例
import java.util.ArrayList;import java.util.Arrays;import java.util.List; public class TestArrays { ...
- Timus1132(二次剩余方程求解)
题目:http://acm.timus.ru/problem.aspx?space=1&num=1132 题意:就是给出方程,p为素数,求在区间内的解. 这个思路很简单,详见:http://a ...
- node.js基础模块http、网页分析工具cherrio实现爬虫
node.js基础模块http.网页分析工具cherrio实现爬虫 一.前言 说是爬虫初探,其实并没有用到爬虫相关第三方类库,主要用了node.js基础模块http.网页分析工具cherri ...
- Luogu 考前模拟Round. 1
A.情书 题目:http://www.luogu.org/problem/show?pid=2264 赛中:sb题,直接暴力匹配就行了,注意一下读入和最后一句话的分句 赛后:卧槽 怎么只有40 B.小 ...
- hdu-4612-Warm up(边双连通分量--有重边)
题意:有N 个点,M条边,加一条边,求割边最少.(有重边) 分析:先求双连通分量,缩点形成一个生成树,然后求这个的直径,割边-直径即是答案 因为有的图上可能有重边,这样不好处理.我们记录每条边的标号( ...
- 【转】基于 Android NDK 的学习之旅-----数据传输(引用数据类型)
原文网址:http://www.cnblogs.com/luxiaofeng54/archive/2011/08/20/2147086.html 基于 Android NDK 的学习之旅-----数据 ...
- 高效算法——C 分饼
My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N ...
- [Locked] Paint Fence
Paint Fence There is a fence with n posts, each post can be painted with one of the k colors. You ha ...
- AOJ 0525 穷举
题意:有一个烤饼器可以烤r行c列的煎饼,煎饼可以正面朝上(用1表示)也可以背面朝上(用0表示).一次可将同一行或同一列的煎饼全部翻转.现在需要把尽可能多的煎饼翻成正面朝上,问最多能使多少煎饼正面朝上? ...