CF112A.Petya and Strings

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 11 to 100100 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

    0
    
  • 输入#2

    abs
    Abz
    

    输出#2

    -1
    
  • 输入#3

    abcdefg
    AbCdEfF
    

    输出#3

    1
    

说明/提示

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
首页