“有道难题——编程挑战赛”，如何为实习生安排座位

今天买了一本9月的《程序员》，看到“有道难题——编程挑战赛”的一道试题，虽然杂志上有刊登思路和关键部分的原代码，但是我觉得还是自己独立写写最好玩，所以就用Python写了个解答，不敢保证100%正确，但是至少通过了我自己写的十几个测试^_^

 

如果有哪位朋友发现有bug，欢迎指正～

 

另外我发现这位仁兄发了好多“有道难题”的C语言解答 ，包括本题，各位可以参考。

 

题目如下：

 

Problem Statement 500’
	有道最近招聘了一批实习生，给他们安排座位时遇到了一个有趣的问题。办公室有N排，每排有M 个座位。为了方便实习生和全职员工更好的交流，安排座位时，我们不让任何2个实习生座位水平，竖直或者对角线相邻。 给定一个vector <string> intern , 把intern 的每个元素依次拼接起来得到一串以单个空格隔开的数字。这串数刚好有N个，第i个数字表示安排在第i排的实习生数量。请计算满足条件的座位安排方案总数。因为总数可能过大，返回方案总数除以1000000007的余数。
Definition
	Class: YoudaoIntern Method: numberOfWays Parameters: int, vector <string> Returns: int Method signature: int numberOfWays(int M, vector <string> intern) (be sure your method is public)
Constraints
-	M 在1到15之间，含1和15。
-	intern 有1到50个元素，含1和50。
-	intern 的每个元素包含1到50个字符，含1和50。
-	intern 所有元素拼接起来后，会得到一串以单个空格隔开的数字，数字不会以0开始，这串数不会以空格开始或结尾，也不会有连续的空格。
-	intern 元素拼接得到的数字串包含1到200个数字，含1到200，每个数字大小在0到M 之间，含0和M 。

 

Python语言的解答程序：

（注意，我的答案并没有按照题目要求取1000000007的余数，因为Python能够自动计算长整数，虽然这样会导致程序变慢...另外，我的函数的输入也不是字符串，因为本来就是想得到一些列的整数嘛，直接给整数就好了，从字符串变过来不是自己给自己找麻烦嘛...我又不是为了参加竞赛...）

# encoding:utf8 # time: 8:04 # file: solve_intern_youdao.py def solve(m, L): '''Arguments: m -> the number of columns, L -> a list where the ith member of L is the number of interns in ith row. Return: n --> The total number of ways to arrange the seats of interns according to the given parameters. ''' n = len(L) # the number of rows psbArrgsForRow = {} # possible arrangments for a row # psbArgsForRow[I] in which I out of M preRowArrgs = [] curRowArrgs = [{'arrg':0, 'num':1}] tmpArrgs = [] for i in range(n): # init li = L[i] preRowArrgs = curRowArrgs curRowArrgs = [] # get possible arrangements if not psbArrgsForRow.has_key(li): psbArrgsForRow[li] = calPsbArrgs(li, m) tmpArrgs = psbArrgsForRow[li] # validate each possible arrangment for ta in tmpArrgs: num = 0 for pra in preRowArrgs: if not doArrgsCnflct(ta, pra['arrg']): num = num + pra['num'] if num > 0: curRowArrgs.append({'arrg':ta, 'num':num}) # sum up and get the result n = 0 for cra in curRowArrgs: n = n + cra['num'] return n def calPsbArrgs(ni, m): '''Args: ni -> the number of interns, m -> the number of columns, i.e. number of seats in each row Return: L -> A list, the member of which is a integer with the lower m bits denote whether seats are occupied by interns''' if ni > m : return [] elif ni == 0: return [0] L = [] for i in range(2 ** m): if (i & (i << 1)) == 0: numOfOne = 0 for j in range(m): if (i & (1 << j)) != 0: numOfOne = numOfOne + 1 if numOfOne == ni: L.append(i) return L def doArrgsCnflct(a, b): '''Args: a, b -> both a and b are integers denoting the arragement of a row Return: True or False ''' if(a & b ) != 0 or / (a & (b << 1)) != 0 or / (a & (b >> 1)) != 0: return True else: return False

 

 

测试程序：

# encoding:utf8 # file:test_solve_intern_youdao.py from solve_intern_youdao import * import unittest class CalPsbArrgsTestCase(unittest.TestCase): def check(self, case): '''Args: case[0] -> the expected result, all possbile arrangements for a row in which ni out of m seats are given for interns; case[1] --> ni, number of interns; case[2] --> m, number of seats in a row or number of columns. ''' print "case:", case print "expected result:", calPsbArrgs(case[1], case[2]) assert set(case[0]) == set(calPsbArrgs(case[1], case[2])) #order is not required to be same print "passed~" def test(self): print "/n========Test calPsbArrgs=======" cases = [([1], 1, 1), / ([4,2,1], 1, 3), / ([], 2, 2), / ([10, 9, 5], 2, 4) ] for c in cases: self.check(c) class doArrgsCnflctTestCase(unittest.TestCase): def check(self, case): print "case: ", case, "... ", a = int(case[1], 2) b = int(case[2], 2) assert case[0] == doArrgsCnflct(a, b) print "passed~" def test(self): print "/n=======Test doArrgsCnflct======" cases = [(True, '1', '1'), / (True, '0101', '0101'), / (True, '0010', '0001'), / (False, '0', '0'), / (False, '00010', '10000'), / (False, '100', '001') ] for c in cases: self.check(c) class ProblemTestCase(unittest.TestCase): def check(self, case): N = case[0] m = case[1] L = case[2] print "case: N=",N , ", m=",m, ", L=",L, "solving...", myN = solve(m, L) print "result:", myN assert N == myN print "passed~" def testTrivalCases(self): print "/n=======Test trival cases======" cases = [(1, 1, [0]), / (0, 1, [1,1]), / (0, 2, [1,1]), / (0, 3, [2, 1]), / (1, 1, [1]), / (1, 1, [1,0,1]), / (2, 2, [1, 0]), / (2, 2, [0, 1]), / (2, 3, [1,1]), / (2, 3, [1,1,1])] for c in cases: self.check(c) def testSampleCases(self): print "/n=======Test sample cases======" cases = [(1, 3, [2]), / (4, 4, [1]), / (2, 3, [1,1,1]), / (0, 14,[2, 10]), / (10, 4, [1,1,1])] for c in cases: self.check(c) def testComplexCases(self): print "/n======Test complex cases:=====" A = 1000 # I don't know the answer for this complex case... cases = [(A, 15, [2,4,3,1,6,2,4,3,5,1,5,2])] for c in cases: self.check(c) if __name__ == "__main__": unittest.main()