Codeforces——112A Petya and Strings

最新推荐文章于 2022-06-22 17:45:54 发布

真田伊廉

最新推荐文章于 2022-06-22 17:45:54 发布

阅读量339

点赞数

文章标签： 1024程序员节 acm竞赛

本文链接：https://blog.csdn.net/weixin_44287647/article/details/109260329

版权

这篇博客介绍了Codeforces的一道题目，Petya需要比较两个忽略大小写的字符串的字典序。文章提供输入输出格式、示例，并简单分析了这是一个关于字符串比较和大小写不敏感的问题。

摘要由CSDN通过智能技术生成

小声BB

又过了一天，打了场取证比赛，头昏脑胀，就写写博客不做题了

题干

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 t