After Borko's second plan of taking over the village fell through (because Mirko's brother Stanko drank all the water), young Zvonko decided to relax with sports. For this purpose he stocked up on carrot juice and peanuts, and dived onto the couch, ready to watch the next tennis match on television.
While the two players are warming up, their statistics pop up on the screen. Zvonko noticed that the match history of the players contained invalid results. He had a brilliant idea where you write him a program that checks the validity of results, which he will then sell to the record keepers and enjoy a leisurely life.
A tennis match consists of sets, each set consisting of games. The following rules apply:
- A player wins a set if he has 6 or more games and at least two games more than his opponent.
- Additionally, if the result is 6:6 in the first or second set (but not the third set), a single final game is played to determine the winner of the set (the tie-break game).
- The match ends when either player has won 2 sets. That player is the winner.
A match result is valid if a match could have been played by the above rules and ended in the result.
Additionally, if one of the players is Roger Federer (designated as federer
in the input), then a result in which he has lost a set can't be valid (Zvonko knows Federer is from outer space).
Write a program that checks the validity of all matches between two players.
Input Specification
The first line of input contains the names of the two players separated by a single space. Both names will be strings of at most 20 lowercase letters of the English alphabet. The names will be different.
The second line contains an integer , how many matches the two players have played.
Each of the following lines contains the result of a single match, composed of the results of a number of sets separated by single spaces. Each match result contains between and sets.
A set is given in the format A:B
, where and are games won by each player. These numbers will be integers between and (inclusive).
Output Specification
For each match, in the order they're given in the input, output da
if the result is valid, or ne
if it isn't.
Sample Input 1
sampras agassi
6
6:2 6:4
3:6 7:5 2:6
6:5 7:4
7:6 7:6
6:2 3:6
6:2 1:6 6:8
Sample Output 1
da
da
ne
da
ne
da
Sample Input 2
federer roddick
1
2:6 4:6
Sample Output 2
ne
Comments
Why is the result for the 4th match in the first sample case "da"? If the score was "7:6" in both sets, then wouldn't neither player have won each set ("A player wins a set if he has 6 or more games and at least two games more than his opponent")? It seems to me that the result of the match is indeterminate which means that the output would be "ne".
Read the rules more carefully:
But the result is 7:6 not 6:6 ...
The result was 6:6, then they played a tie-breaking game which upped the result to 7:6
Ok I get it now. Thanks!
Hey, I don't know Croatian. Please help!?
This comment is hidden due to too much negative feedback. Show it anyway.
This comment is hidden due to too much negative feedback. Show it anyway.
I, too, agree. The faults in spelling are beyond unacceptable!
Tenis is the spelling used on the official statement
Additionally, Tenis is the correct spelling in Croatian
This comment is hidden due to too much negative feedback. Show it anyway.
The statements themselves are in English though, and all COCI problems maintain their Croatian titles. In your case, we should replace every instance of
handsome
in coci14c5p4 withzgodan
.This comment is hidden due to too much negative feedback. Show it anyway.
Or we can translate it into Croatian. Just for you.
Thanks