CT22691

Petr and the Timeworn riddles

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Every season at the mountain city of Highreach, someone must assign crews to the morning shifts. This year the task falls to Petr, armed only with the riddles register. Task: Compare s and t lexicographically: print -1 if s<t, 0 if s==t, 1 if s>t. Input format: Two lines: string s, then string t. Output format: Print -1, 0, or 1. Constraints: 1 <= |s|,|t| <= 887.

Example 1:

Input: luvbbrrlhyqajocvllyjxcceqhzwloaawkiyzivmslkueejfhsitdwuolwshmfvlbdgknlzwohwxtzlzcylfrsyfovfxbyvliqwfovcwtgwgslfefwczoxpstukixyoaiegglmvkezutyohpugskekxplosnzotdiwnxrnwippvyrpmaccikskcxrpcbhzzwyyovilwcssqgfpxhkzzbpwswgnhgqezfeoaixjrxdhkivqnnnyquhqslvdwkxuzxemforvnxvaigqeveaobmhgiwlshwamhsxxebgpxblcuvxlglfzfkajehmmgloqbldemkkcfzstehfeuvswudawgthgvyeoeuoyjssjrhbuxmaciyxndbgpsrqixywcypehkiqxdugtyuuartqaepupmmygbfroachqfklycncwjdvekbqqecfqauhbsybyofpliouhnckykwgilfaudmfidfelaouduqbynalxeirmpukylcktwqklshyakyjsffqvvmtnwmwpwhnvpbchhhdyqgcsymlvearn rqkbphbigvfohbfswuvnmgydkqxexgqopydthahgafqxdyuqbtfpawziazfhsyrlbvmqeoxiiaexzdxaowifyjoqtrmfirnxodyszqmbyctzsatcfmthsnwnqdhxhdcbzyzymwofsvawsqdubhhcbwajnfcbzlyrjdcbtppgdowaeumztywtdfqgwkcqvuomdlnfxxxpumhunaxixssbzaevefolegpwfqxqxkqjzemzxffmgohrtlmzcibtkkupwrsahgccixptqfleigfgczdiufqzvvgdgecqgmnhdmacjtugvfobmxwmur
Output: -1

Example 2:

Input: kcigezlxnozxivvoeiphbnvmhgtyeavfykjysznocdcpsatnxpausvhgplxlmpmzqqnanqqxnzfmdjyqxylwjkqlrbjnoyewwadqbmlwtpixmgueloigykxaorqcvvisbnwclofqgtynlkwfqvskqbsgsxrglstgczocssdzoknyreakrhlqxuboesogmcnetaarblqiedcauwwrheirundrjigppoexwporrsktfrscjqvdqgcjebaylefoobjxnowiqwuddkubuliskyhskjhyluuyxigvvbrsvfqppkrfaeqczceqykuzciwgxdgmelgenaslmhxntiirqbwuyluxfyvqwzqbgqiwmqwnzyulvtqkbthcyrxyuluczyrkvsozokzjlaljmrodbzesgl ooismhraswkpirtfelqpkfojbpvljpmpxmisasywntusesqvpcwcoqxvewweuqfdrlhcddsprtucrmoxfkuleenenvpxnjirbkqobcswtbuzpgzwdgcamqnkircsxmibcdoaddawisebqbfqzalowpxqpzhfqmfizppdthusatlkkvrjevkmapajrgqdwzfeksjgrporhazlqxdxermgkibvehsnwoqimpflhjvwthpdgqsnwjpqaincprfjfuazhfiicrivvfqzzqcfxqlaqueodpcfkvhpdzdoyurcplrxpwhqkaynvkfxapotczxxlubckurncisxwmpopypsqptjqvdcuccwgqoqcjcztwsxrylxwybemxifseqckfdjgnxouqbxjyfqvfgtjzzxcugrpqatftrcwlbnyunsdtxliggluobixqmjegkozdfxrwfzgthdwylmdpgoeiajlcaxwqwreyqaytxmqfhqoaoaricfybudjz
Output: -1

Example 3:

Input: ipwghearrzoddbwykcsinjbbuvxlutjszapnieqhvujiegwypbpbjjbjvqhomdpaqonldtrqdixrompfxikdmlptzorxhjnartqlwgymkwbhgjstzgcnxgcboazxvgkyieixsjnowvffjengaohtijhvipmfmtynayunzhsjpooimteubkchkefkvhstwwnfztybxbtowwigmczcwvpegtklfpmuenoeusfnyzoipgwgvojjdpkmmrrxshwaynetkoonlmqgyrhxpbnddrdyytfnrl wswphnvjcuxrtkjwczkubqxafwhhvecnwawykmbvllzkfxtmjvhiczlwxbjsbkupgsxfdqtqkdjrlnzqxudcrjopmlbltmtocjuoqzkhrcvqwlquzyirrvpafpenoyqsxkranlqgcuhmywmcstnbuorarenrtmwwhpwjfbczsjmssjprfhbofzqtiaohporyuquewawfzcahvgrtmxauukinmqwpwpbmhaxbkrkitdqzmnzqoqfqkswznfhovlkosjsavsurqcxicpfnvlkdzzjflwgdyzjvrcodvtdqwpmnnzicamqqedbiipjyfdmjhhfggbrbsbkodpnyfnpokbxokpkosyjsilmvheubfipzbvfutuejbqwnippunjuysanwkesdxkjtzgiokoguuwvrzsayfhgetpqbbylqyalujnalnbrqsxkqungfsalfkxxhtftwbtmqyyvpxlmuokbmplgknvyeshnbmzlzndwrqfhvqrtjjnibtivsdwdgilpjtxmahkucnqoakcbcakzrmsowovtkseaukqfuvuatiakgwvbwubagkkcufeglantttamcwmfkoliivpvskbgezchinzopbcsdkyxlnpzmqgvvldnveaoogsoaqsworxosdxpuu
Output: -1

Constraints:

1 <= |s|,|t| <= 887.

Loading...
Test Cases:No test cases
No test cases available.
Petr and the Timeworn riddles - EASY Coding Problem | CodeTikki