35A - Shell Game - CodeForces Solution


implementation *1000

Please click on ads to support us..

Python Code:

rFile = open("input.txt", 'r')
pos = int(rFile.readline())
for i in range(3):
    cup1,cup2 = [int(item) for item in rFile.readline().split(' ')]
    if pos == cup1:
        pos = cup2
    elif pos == cup2:
        pos = cup1

rFile.close()
wFile = open("output.txt", 'w')
wFile.write(str(pos))
wFile.close()


Comments

Submit
0 Comments
More Questions

72. Edit Distance
563. Binary Tree Tilt
1306. Jump Game III
236. Lowest Common Ancestor of a Binary Tree
790. Domino and Tromino Tiling
878. Nth Magical Number
2099. Find Subsequence of Length K With the Largest Sum
1608A - Find Array
416. Partition Equal Subset Sum
1446. Consecutive Characters
1618A - Polycarp and Sums of Subsequences
1618B - Missing Bigram
938. Range Sum of BST
147. Insertion Sort List
310. Minimum Height Trees
2110. Number of Smooth Descent Periods of a Stock
2109. Adding Spaces to a String
2108. Find First Palindromic String in the Array
394. Decode String
902. Numbers At Most N Given Digit Set
221. Maximal Square
1200. Minimum Absolute Difference
1619B - Squares and Cubes
1619A - Square String
1629B - GCD Arrays
1629A - Download More RAM
1629C - Meximum Array
1629D - Peculiar Movie Preferences
1629E - Grid Xor
1629F1 - Game on Sum (Easy Version)