Petya and Strings

一、Petya and Strings

本题链接：

题目：

A. Petya and Strings
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

Examples

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

本博客给出本题截图：

题意：依次比较两个字符串的每一位，如果不同就比较大小。

AC代码

#include <iostream>
#include <string>using namespace std;int main()
{
    string a, b;cin >> a >> b;int cnt1 = 0, cnt2 = 0;for (int i = 0; i < a.size(); i ++ ){
    if (a[i] >= 'A' && a[i] <= 'Z')a[i] = a[i] - 'A' + 'a';if (b[i] >= 'A' && b[i] <= 'Z')b[i] = b[i] - 'A' + 'a';if (a[i] > b[i]){
    cout << "1" << endl;exit(0);}if (a[i] == b[i]) continue;if (a[i] < b[i]) {
    cout << "-1" << endl;exit(0);}}cout << "0" << endl;return 0;
}

总结

string 线
uppercase 大写字母
compare 比较
lexicographically 字典学上
corresponding 相应的
equivalent 相同的
range 范围
inclusive 包含的
guaranteed 保证

水题，不解释