codeforces 112APetya and Strings(字符串水题)
2015-12-24 15:14
323 查看
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.
Sample test(s)
Input
Output
Input
Output
Input
Output
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 比較字符串,不分大写和小写,相等输出0,大于输出1,小于输出-1。
代码:
点击打开题目
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.
Sample test(s)
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 比較字符串,不分大写和小写,相等输出0,大于输出1,小于输出-1。
代码:
#include <iostream> #include<string.h> using namespace std; int my_strcmp(char c[],char s[]) { int k=strlen(c),i; for(i=0;i<k;i++) { if(c[i]>='A'&&c[i]<='Z') c[i]+=32; if(s[i]>='A'&&s[i]<='Z') s[i]+=32; } return strcmp(c,s); } int main() { int k; char c[101],s[101]; while(cin>>c) { cin>>s; k=my_strcmp(c,s); cout<<k<<endl; memset(c,'\0',sizeof(c)); memset(s,'\0',sizeof(s)); } return 0; }
相关文章推荐
- 把数组格式数据转换成字符串存入数据库
- Android 获取设备唯一标识码
- Android Makefile 文件讲解
- 数据结构课程设计
- 多线程示例模仿
- [CSS]手机端网页开发问题及解决方法整理
- MVC 上传文件实例
- iOS中SVN使用
- 表连接查询
- 一些高薪职位的能力需求。
- Swift 中添加依赖库
- Windows 环境下配置MXNET教程
- uiscrollview_和_滑动返回冲突解决
- echarts之title-textAlign
- [易飞]进销存统计表
- 测试
- ASP.NET html转图片
- 7.Android之评分条RatingBar和拖动条SeekBar学习
- Android开发之完成登陆界面的数据保存回显操作实例
- Opengl如何从磁盘中加载图片生成纹理对象