CT26482

Dora Counts the verses

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Dora the surveyor watches over the cinnabar mines of Vermilion's stores of verses. A careful computation stands between order and chaos. 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| <= 701.

Example 1:

Input: qyjss crfouzewkmpbknspiwpfovaeoqohlnyvfhakxapbwgohtytwojkecqhkctnkrwemnebcblxkgsqwmoahsudajaqqigjxpjfvgexztvjmlmclqyxhpeksftqiqpnsmnoltrvdpsp
Output: 1

Example 2:

Input: ipalxdocomsbpipufrvhhucvzvohzslvjfqbaqkubfxcpjefjvpfbjhppvutdtoagptkpcnngbougfjuxgubetmfjjabrtqxksykrstiuttnvfigvrdcubfhpqyezerntjvjcbvjnujqotstzkquaiylewuausvgwbfewtfhilldfnxxholndqqekhymyfaxyobnhgcdrcozrcqknsjdyudpuxwnsmobevcozqeoyxmnadaeaqurwyewwofqxsnwhfcprxerppxpjjbglynftisomcsrmdwrkwhhyxwiw lmiswlbckosghvaxaropw
Output: -1

Example 3:

Input: dpkugvvtutwurkhqamvjuschmndxaohtmcljpswqlqaackqxyjesndfaqwbbtanpmfscqsddicpicmbogxhtmlryjyjjkixukvynupwzxxlrrnikohimlcnfunidpqecquphbgxzexukjgqrzqyuasjxhxohdruxbmneseeyazkugxclhyqorvwlhvycdzhxjzgtvmbtuedhukycrjmqtzmaguyozakufflfnlbcdbaetxssbbydoydxbyvtupghekgwvpdanokxvccaautlnjxxvxmedtujzokhpdhvfqegpcpsserqbdkgongvfhhirydpqbwab bayllabbvmhtiswoqlnkdmyorqtrifsmjfthppidoczpznrrzyszvytulickuclepvwtrdghgkohdfjwkegwuilqqtlgmbwikyizzukxcauilzndxgwpichsunxdoufgkyxcatzzvipkdkpzetacgxglqaqmeelpaenpfwkexxzfkudcffdsdmcrwzvnoedbrxkjcdawksbvjroakjxzuluvqfjjcaphlhugtntcsefhixqxruooqcbimfntagcsqcicznfxkqjxueafbcsnkzyoscyeilpafovbmmaidilaccwkwshjeaopaqtojizdfdgguzihutmhwtrljbsapilzbxpbcnlveapaassxceebgsonyqqrmcfjeuvkjmougpigcgjrbszrsmfclwalfdvbxwvmxywzzpjkouehzgrjbbluggrepyqcbsnmnxpvsqzxqwgvyyteyzgtgkptnl…
Output: 1

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Dora Counts the verses - EASY Coding Problem | CodeTikki