4236.Petya and Strings

Time Limit: 1s Memory Limit: 256MB

Little Petya loves presents. His mum bought him two strings of the same size for his birthday. The strings consist of uppercase and lowercase Latin letters. Now Petya wants to compare those two strings lexicographically. The letters' case does not matter, that is an uppercase letter is considered equivalent to the corresponding lowercase letter. Help Petya perform the comparison.

Input Format(From the terminal/stdin)

Each of the first two lines contains a bought string. The strings' lengths range from 1 to 100 inclusive. It is guaranteed that the strings are of the same length and also consist of uppercase and lowercase Latin letters.

Output Format(To the terminal/stdout)

If the first string is less than the second one, print "-1". If the second string is less than the first one, print "1". If the strings are equal, print "0". Note that the letters' case is not taken into consideration when the strings are compared.

Sample Input 1

Copy
aaaa
aaaA
    \n
    \n

Sample Output 1

Copy
0
 \n

Sample Input 2

Copy
abs
Abz
   \n
   \n

Sample Output 2

Copy
-1
  \n

Sample Input 3

Copy
abcdefg
AbCdEfF
       \n
       \n

Sample Output 3

Copy
1
 \n

Hints

If you want more formal information about the lexicographical order (also known as the "dictionary order" or "alphabetical order"), you can visit the following site:
http://en.wikipedia.org/wiki/Lexicographical_order

Submit

请先 登录

© 2025 FAQs