乱步摧城 - 博客园

MIT6.00 problem set 1 第1000个素数

摘要： 1 prime = [2] 2 def getprime(n): 3 global prime 4 x = 1 5 p = 3 6 while x<n: 7 primeT = True 8 for i in prime: 9 ... 阅读全文

posted @ 2014-11-14 22:33 乱步摧城阅读(182) 评论(0) 推荐(0)

摘要： 1 def draw(c): 2 global paddle1_pos, paddle2_pos 3 4 paddle_width = 80 5 6 if paddle_width/2 <= paddle1_pos + paddle1_vel <= width ... 阅读全文

posted @ 2014-11-05 09:57 乱步摧城阅读(239) 评论(0) 推荐(0)