← 返回题目

题库练习 Petya and Strings

← 上一题下一题 →

A8187 | $Petya and Strings$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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.

输入格式

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.

输出格式

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.

输入输出样例

输入 #1

aaaa
aaaA

输出 #1

输入 #2

abs
Abz

输出 #2

-1

输入 #3

abcdefg
AbCdEfF

输出 #3

C++ 编辑器

输入

输出