CodeForces - 112A Petya and Strings
2017-03-04 20:46
316 查看
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 from1 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.
Example
Input
Output
Input
Output
Input
Output
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 from1 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.
Example
Input
aaaa aaaA
Output
0
Input
abs Abz
Output
-1
Input
abcdefg AbCdEfF
Output
1
逐位比较
代码如下:
#include<stdio.h> int main() { char a[101],b[101]; scanf("%s%s",a,b); int i; for(i=0;a[i]!='\0';i++) { if(a[i]<='Z'&&a[i]>='A') a[i]+=32; if(b[i]<='Z'&&b[i]>='A') b[i]+=32; if(a[i]>b[i]) { printf("1\n"); break; } else if(a[i]<b[i]) { printf("-1\n"); break; } } if(a[i]=='\0') printf("0\n"); return 0; }
相关文章推荐
- codeforces 204 Jeff and Rounding
- Soldier and Cards(Problem - 546C - Codeforces)
- codeforces 616F
- codeforces 501C Misha and Forest(找边)
- Codeforces 441C Valera and Tubes
- codeforces 632C (练习Java排序)
- Codeforces-352B
- 【CODEFORCES】 B. Dreamoon and WiFi
- Codeforces Round #347 (Div. 2) B. Rebus (codeforces 664b) (构造)
- Codeforces 500C:New Year Book Reading(思维+贪心?)
- codeforces 468B two set(并查集)
- [CodeForces-555D]Case of a Top Secret
- CF->CodeForces 137C
- codeforces 553A Kyoya and Colored Balls
- Codeforces--333C--The Two Routes(最短路弗洛伊德)(思维)
- codeforces 713C
- Codeforces 621D Rat Kwesh and Cheese【Long Double】
- CodeForces 864D Make a Permutation! 【贪心】【模拟】
- codeforces-Domino
- Codeforces 557D - Vitaly and Cycle (DFS染色)