zoukankan      html  css  js  c++  java
  • Codeforces 112A

    题目: 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 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

    思路:

    用strlwr函数将两个字符串都转换为小写字母,接着再用strcmp函数比较即可~

    代码:

    #include<iostream>
    #include<cstring>
    using namespace std;
    int main(){
    	char c1[101],c2[101];
    	scanf("%s%s",c1,c2); 
    	strlwr(c1);
    	strlwr(c2);
    	printf("%d",strcmp(c1,c2));
    	return 0;
    }
    
  • 相关阅读:
    psp4
    一维循环数组最大子数组求解
    psp3
    psp2
    求二维数组最大连续子数组
    计算连续最大子数组问题
    psp1
    关于30道题目问题
    Java 文件操作
    java iterator
  • 原文地址:https://www.cnblogs.com/yuhan-blog/p/12308970.html
Copyright © 2011-2022 走看看