The Big Fight
All submissions for this problem are available.
Nikhil and Nancy are very competitive. The newest competition they have created is about looking at the plates of the cars. Each time one of them sees a car plate in the streets, he or she sends to the other an SMS message with the content of that plate; the one who has seen the newest plate is in the lead of the game. .
Nikhil has a very smart eye and he has stayed on the lead for several weeks. Maybe he keeps looking at the streets instead of working. Nancy, tired of being always behind, has written a program that generates a random plate, so the next time Nikhil sends a message to her, she will respond with this generated plate. In this way, she hopes to give Nikhil a hard time trying to beat her.
However, Nikhil has grown suspicious, and he wants to determine if Nancy actually saw a car with the plate she sent or not. This way, he will know if Nancy is in the lead of the game.
He knows some facts about the plates assigned by the Board:
1. Each plate is a combination of 7 characters, which may be uppercase letters (A-Z), or digits (0-9). 2. There exists two kinds of plate schemes: the old one, used for several years, and the new one which has been in use for some months, when the combinations of the old one were exhausted. 3. In the old scheme, the first three characters were letters, and the last four were digits, so the plates run from AAA0000 to ZZZ9999. 4. In the new scheme, the first five characters are letters, and the last two are digits. Unfortunately the chief of Board messed up with the printing system while he was trying to create a poster for his next campaign for mayor, and the printer is not able to write the letters A, C, M, I, and P. Therefore, in this new scheme, the first plate is BBBBB00, instead of AAAAA00. 5. The plates are assigned following a sequential order. As a particular case, the last plate from the old scheme is followed by the first plate from the new scheme.
As Nancy is not aware of all of this, she has just made sure that her random generator creates a combination consisting of seven characters, where the first three characters are always uppercase letters, the last two characters are always digits, and each one of the fourth and fifth characters may be an uppercase letter or a digit (possibly generating an illegal combination, but she has not much time to worry about that).
Of course, Nikhil will not consider Nancy the winner if he receives an illegal combination, or if he receives a legal plate, but equal to or older than his. But that�s not all of it. Since Nikhil knows that new plates are not generated too fast, he will not believe that Nancy saw a car with a plate newer than the one he sent, but sequentially too far. For example, if Nikhil sends DDDDD45, and receives ZZZZZ45, he will not believe that Nancy saw a car with that plate, because he knows that the Board couldn�t have printed enough plates to get to ZZZZZ45 in the time he received that answer.
So, Nikhil has decided to consider Nancy the winner only if he receives a legal plate, newer than his, and older than or equal to the C-th consecutive plate after the one he sent. He calls C his confidence number. For example, if Nikhil sends ABC1234, and his confidence number is 6, he will think that Nancy is the winner only if he receives any plate newer than ABC1234, but older than or equal to ABC1240.
The input file contains test cases. Each test case is described in a single line that contains two strings SM and SI , and an integer C, separated by single spaces. SM is the 7-character string sent by Nikhil, which is always a legal plate. SI is the 7-character string answered by Nancy, which was generated using her random generator. C is Nikhil�s confidence number (1 <= C <= 109). The end of input is indicated by SM = SI =�*� and C = 0.
For each test case, output a single line with the uppercase character �Y� if, according to Nikhil, Nancy is the winner, and with the uppercase character �N� otherwise.
Input: BBBBB23 BBBBC23 100 BBBBB23 BBBBD00 77 ZZZ9997 ZZZ9999 1 ZZZ9998 BBBBB01 3 ZZZZZ95 ZZZZZ99 10 BBBBB23 BBBBB22 5 * * 0 Output: N Y N Y Y N
|Time Limit:||0.8125 sec|
|Source Limit:||50000 Bytes|
|Languages:||ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, COB, CPP 4.3.2, CPP 6.3, CPP14, CS2, D, FORT, FS, GO, HASK, ICK, ICON, JAVA, JS, kotlin, LISP clisp, LISP sbcl, LUA, NEM, NICE, NODEJS, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYPY, PYTH, PYTH 3.5, RUBY, rust, SCALA, SCM chicken, SCM guile, SCM qobi, ST, swift, TEXT, WSPC|
Fetching successful submissions
If you are still having problems, see a sample solution here.