HackerRank "Vertical Rooks"
2016-02-11 05:15
387 查看
Please note: VROOK cannot go back-ward - that leads to a simple variation to Game of Nim: just XOR.
t = int(input()) for _ in range(t): n = int(input()) # Get input p1 = [] for _ in range(n): p1.append(int(input())) p2 = [] for _ in range(n): p2.append(int(input())) # Game of Nim nim = 0 for i in range(n): nim ^= abs(p2[i]- p1[i]) - 1 print ("player-2" if nim != 0 else "player-1")
相关文章推荐
- java 基础总结 -- enum 枚举与接口、泛型、集合的使用
- 地铁线路图的设计与实现
- LeetCode Shortest Word Distance
- 51Nod 1305 Pairwise Sum and Divide(规律、数学)
- PowerShell 字符串的几种类型判断
- Java中使用Cookie记录用户访问次数
- 51Nod1381 硬币游戏(概率+题解)
- ng-repeat的group
- 好的学习资源
- 三打白骨精
- 4.6.x IL2CPP问题汇总
- LeetCode Flip Game II
- UNDER THE HOOD OF THE NEW AZURE PORTAL
- QString, string, char* 相互转换
- POJ 3684 Physics Experiment(弹性碰撞)
- LeetCode Flip Game
- hdoj 4405 Aeroplane chess(概率dp)
- 全国计算机等级考试C语言考试程序改错题
- 全国计算机二级考试ACCESS入门教程
- vcs 入门