ARDH1 - Size Contest Returns !!
Prachi loves Aradhya. But Aradhya is unaware of that.
She is so crazy about him that she decides to give him a surprise on Valentine's day. She tells Aradhya that she loves him by giving him a red rose. Aradhya totally surprised by this behaviour tells Prachi that he has a collection of rings that has I LOVE YOU written on some of them but it's not necessary that the words I LOVE YOU appear one after the other but they should appear in sequence. He asks Prachi to pick up a ring and if it contains I LOVE YOU he will accept her proposal. Since it's a ring you can start reading from anywhere.
Remember the words I LOVE YOU should appear as whole and not be formed by joining two words or should not be a substring of some word. (Thanks Mitch for pointing out the description.)
Best of luck, Prachi
Input
First Line Contains T (<= 100).
Next T lines contain a string 's'.
|s| <= 1000
Output
For each test case print "I LOVE YOU TOO." if string contains I LOVE YOU else print "HARD LUCK PRACHI.".
Example
Input: 2 I AM IN LOVE WITH YOU I AM AMERICAN AND DON'T MESS WITH ME Output: I LOVE YOU TOO. HARD LUCK PRACHI.
The less you write the more you gain.
hide comments
Mitch Schwartz:
2014-12-22 00:46:21
At the moment, getting the best score seems to be a "guess the input weakness" game. (Aside from guessing the task itself.)
|
|
Mitch Schwartz:
2014-12-21 15:08:57
No, rules are still not clear.
|
|
Francky:
2014-12-21 14:25:26
Not I, but maybe some others don't LOVE punctuation, what about YOU?
|
|
(Tjandra Satria Gunawan)(曾毅昆):
2014-12-21 13:43:57
I think there are error in this problem configuration.
|
|
Mitch Schwartz:
2014-12-21 07:07:59
1) Max number of characters per line should be mentioned.
|
Added by: | Aradhya |
Date: | 2014-12-20 |
Time limit: | 1s |
Source limit: | 300B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Own Problem |