138. Games of Chess
time limit per test: 0.25
N friends gathered in order to play chess, according to the following rules. In the first game, two of the N friends will play. In the second game, the winner of the first game will play against another friend (maybe even the same friend who lost the first game). In the third game, the winner of the second game will play against someone else and so on.. No game will end as a draw (tie). Given the number of games each of the N friends played, find a schedule for the games, so that the above rules are obeyed.
The first line contains the number of friends N (2<=N<=100). The second line contains N integers, separated by blanks, representing the number of games each friend played. The first number represents the number of games played by the first friend, the second number represents the number of games played by the second friend and so on..
The first line should
contain the number of games played by all the friends (it will be an integer
between 1 and 10 000, for every test case). Let's suppose
this number is G. Then, G lines follow, each of them containing
two integers, describing the games. The first line contains the numbers
of the two friends who played the first game. The friend printed first
is considered to be the winner. Each of the next G-1 lines contain
the integers a and b, where
a<>b and a or
is the winner of the previous game. The friend printed first on the line
is considered to be the winner of the game.
4 2 4 1 5
6 4 3 4 1 2 4 2 1 4 2 2 4