In a town, there are over 100 flats.
Flat-1 is named first flat.
Flat-2 is named second flat.
Flat-3 is named third flat.
A visitors 'Victor' decides to walk through all the flats, he finds all the flats except flat-62.
Victor later founds that the local of the town have given it another name.
On a charity event in Russia, Murray beat Djokovic by winning six games and losing three games.
Note: There is a total of 5 service breaks(one who serve lost the game).
Who served first, Djokovic or Murray?
You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?