112A_Petye_and_Strings.cpp

/* A.                                 Petya and Strings

                                                       time limit per test2 seconds
                                                       memory limit per test256 megabytes
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

*/

#include<bits/stdc++.h>
#include<string>
#include<algorithm>
using namespace std;

int main(){
	
	
  string s1,s2;
  cin>>s1>>s2;
  
    transform(s1.begin(), s1.end(), s1.begin(), ::tolower);
    transform(s2.begin(), s2.end(), s2.begin(), ::tolower);

    if (s1 > s2)
        cout<<"1";
    else if (s1 < s2)
        cout<<"-1";
    else
    cout<<"0";
   return 0;
}#include<bits/stdc++.h>
#include<string>
#include<algorithm>
using namespace std;

int main(){
	
	
  string s1,s2;
  cin>>s1>>s2;
  
    transform(s1.begin(), s1.end(), s1.begin(), ::tolower);
    transform(s2.begin(), s2.end(), s2.begin(), ::tolower);

    if (s1 > s2)
        cout<<"1";
    else if (s1 < s2)
        cout<<"-1";
    else
    cout<<"0";
   return 0;
}