Codeforces 112A-Petya 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 stringslexicographically.
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

比較两个字符串的大小，不区分大写和小写。。

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <cstdlib>
#include <set>
#include <map>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
const int INF = 0x3f3f3f3f;
#define LL long long
char s1[200], s2[200];
int main()
{
	while (scanf("%s%s", s1, s2) != EOF) {
		for (int i = 0; i < strlen(s1); i++) {
			s1[i] = toupper(s1[i]);
		}

		for (int i = 0; i < strlen(s2); i++) {
			s2[i] = toupper(s2[i]);
		}

		printf("%d\n", strcmp(s1, s2));
	}

	return 0;
}