SHOW:
|
|
- or go back to the newest paste.
1 | def generatePivots(numOfPlayers): | |
2 | pivots = [] | |
3 | for player in range(numOfPlayers): | |
4 | pivots.append(0) | |
5 | return pivots | |
6 | ||
7 | while True: | |
8 | players, squares = map(int, raw_input().split()) | |
9 | if players == 0 and squares == 0: | |
10 | break | |
11 | pivots = generatePivots(players) | |
12 | traps = map(int, raw_input().split()) | |
13 | numOfRolls = int(raw_input()) | |
14 | trapped = [] | |
15 | winner = None | |
16 | pivNum = 0 | |
17 | modValue = len(pivots) | |
18 | for R in range(numOfRolls): | |
19 | while True: | |
20 | if (pivNum + 1) in trapped: | |
21 | trapped.remove(pivNum+1) | |
22 | pivNum +=1 | |
23 | pivNum = pivNum % modValue | |
24 | else: break | |
25 | pivNum = pivNum % modValue | |
26 | dice = sum(map(int, raw_input().split())) | |
27 | pivots[pivNum] += dice | |
28 | if pivots[pivNum] in traps: | |
29 | trapped.append(pivNum+1) | |
30 | if pivots[pivNum] > squares: | |
31 | winner = pivNum + 1 | |
32 | pivNum += 1 | |
33 | pivNum = pivNum % modValue | |
34 | print(winner) |