python
hjuj_91
这个作者很懒,什么都没留下…
展开
-
三路快排 duplicate keys
def exch(l,i,j): temp = l[i] l[i] = l[j] l[j] = temp def sort(l): quick(l,0,len(l) - 1) def quick(l,lo,hi): if lo >= hi: return v = l[0] i = lo gt = hi lt = lo原创 2013-09-14 16:06:31 · 477 阅读 · 0 评论 -
sudoku
def readSudoku(): c = int(stdin.readline()) sudoku = [] for i in range(c**2): sudoku.append([int(j) for j in stdin.readline().strip().split()]) return sudoku,c def testLine(l原创 2013-10-12 10:18:10 · 551 阅读 · 0 评论 -
Dragon Maze,python
def readMap(): m,n = [int(i) for i in stdin.readline().strip().split()] #print >> stderr,n enx,eny,exx,exy = [int(i) for i in stdin.readline().strip().split()] matrix = [] for i in原创 2013-10-12 16:48:27 · 553 阅读 · 0 评论 -
二分图
class Graph: def __init__(self,n): self.n = n self.v = [[] for i in range(n)] def addEdge(self,a,b): self.v[a].append(b) def edges(self,a): return self.v[a]原创 2013-11-03 17:01:45 · 517 阅读 · 0 评论 -
python 2048 纯console
import random def printBoard(board,score): for line in board: #print " ".join(map(str,line)) def transform(x): if x == "0": return "_" else: return x print "%5s%5s%5s%5s" % tuple(原创 2014-05-18 11:35:22 · 4075 阅读 · 0 评论