A, B, C, D, ..., X, Y, Z are the players who participated in a tournament. Everyone played with every other player exactly once. A win scores 2 points, a draw scores 1 point and a loss scores 0 point. None of the matches ended in a draw. No two players scored the same score. At the end of the tournament, by ranking list is published which is in accordance with the alphabetical order. Then
Answer: A
It can be seen that each of the 26 players played 25 matches.
Since none of the matches ended in a draw, the scores for each of the players has to be even (since a win gives 2 points). So the highest score possible for a player would be 50 and the lowest would be 0.
Since all 26 of them had different scores varying between 0 and 50, the scores should indeed be all the even numbers between 0 and 50. And since the ranks obtained by players are in alphabetical order, it can be concluded that A scored 50, B scored 48, C scored 46 and so on and Z scored 0.
Now the only way A can score 50 is, if he wins all his matches, i.e. he defeats all other players. Now B has scored 48. So he has lost only one of his matches, which incidentally is against A. He must have defeated all other players.
Similarly, C has scored 46 in 25 matches. So he must have lost two matches, (i.e. to A and B) and defeated all other players. So we conclude that a player whose name appears alphabetically higher up in the order has defeated all the players whose name appear alphabetically lower down.
Hence, M should win over N.