Petya and Strings

Petya and Strings

题面翻译

输入两个字符串，大小写无关紧要，比较它们的大小。

输入格式

两个字符串（保证长度相等）

输出格式

如果第一个字符串小于第二个字符串，则输出“-1”。如果第二个字符串小于第一个字符串，则输出“1”。如果字符串相同，则打印“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

样例输入 #1

aaaa
aaaA

样例输出 #1

0

样例 #2

样例输入 #2

abs
Abz

样例输出 #2

-1

样例 #3

样例输入 #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

代码内容

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <stack>//栈
// #include <deque>//队列
// #include <queue>//堆/优先队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{
    string x,y;
    cin>>x>>y;

    for(auto &t:x)
    {
        if(isupper(t)) t+=32;
    }
    for(auto &t:y)
    {
        if(isupper(t)) t+=32;
    }

    if(x<y) cout<<-1<<endl;
    else if(x>y) cout<<1<<endl;
    else cout<<0<<endl;
    
    return 0;
}