Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Light Switching Game
Description The Light Switching Game is played on a 1000 × 1000 × 1000 cube of cells with a light in each cell, as Figure.1 shows. Initially, most of the lights are off while exactly Figure.1 You will find out whether the second player can win if both players play optimally. Input There are multiple test cases.
Every test case starts with one line containing a single number N indicating the number of lights which is initially on. (N ≤ 100)
Each of the next N lines contains the coordinates (x, y, z) (1 ≤ x, y, z ≤ 1000) showing that the light at this position is on initially.Output One line for each test case which contains "Yes" or "No" indicating whether the second player can win the game. Sample Input 4 5 11 30 5 19 19 23 15 6 2 26 16 3 9 20 9 8 1 28 30 22 26 Sample Output Yes No Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator