codeforces 112APetya and Strings（字符串水题）

A. Petya and Strings

点击打开题目

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

Input

aaaa
aaaA

Output

0

Input

abs
Abz

Output

-1

Input

abcdefg
AbCdEfF

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
• 比較字符串，不分大写和小写，相等输出0，大于输出1，小于输出-1。
• 代码：

• #include <iostream>
  #include<string.h>
  using namespace std;
  int my_strcmp(char c[],char s[])
  {
      int k=strlen(c),i;
      for(i=0;i<k;i++)
      {
          if(c[i]>='A'&&c[i]<='Z')
              c[i]+=32;
          if(s[i]>='A'&&s[i]<='Z')
              s[i]+=32;
      }
      return strcmp(c,s);
  }
  int main()
  {
      int k;
      char c[101],s[101];
      while(cin>>c)
      {
          cin>>s;
          k=my_strcmp(c,s);
          cout<<k<<endl;
          memset(c,'\0',sizeof(c));
          memset(s,'\0',sizeof(s));
      }
      return 0;
  }