Preparing NOJ

Petya and Strings

2000ms 262144K

Description:

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:

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:

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:

aaaa
aaaA

Sample Output:

0

Sample Input:

abs
Abz

Sample Output:

-1

Sample Input:

abcdefg
AbCdEfF

Sample Output:

1

Note:

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

Info

CodeForces

Provider CodeForces

Origin Codeforces Beta Round #85 (Div. 2 Only)

Code CF112A

Tags

implementationstrings

Submitted 57

Passed 46

AC Rate 80.7%

Date 03/03/2019 20:35:52

Related

Nothing Yet