112A - Petya and Strings
2014-12-02 11:16
453 查看
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
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
s1=gets.chomp.downcase.split("")
s2=gets.chomp.downcase.split("")
n=s1.length
i,f = 0,1until n==0if s1[i].ord<s2[i].ord
puts -1f=0break
elsif s1[i].ord>s2[i].ord
puts 1f=0break
end
n -= 1i += 1end
puts 0 if f==1
相关文章推荐
- Problem--112A--Codeforces--A. Petya and Strings
- 112A - Petya and Strings
- Codeforces 112A-Petya and Strings(实现)
- Codeforces 112A-Petya and Strings(实现)
- Coderforces Petya and Strings
- A. Petya and Strings
- CodeForces 112 A.Petya and Strings(水~)
- 【CodeForces】A. Petya and Strings
- Petya and Strings
- 【string比较】#85 A. Petya and Strings
- codeforces水题100道 第二十四题 Codeforces Beta Round #85 (Div. 2 Only) A. Petya and Strings (strings)
- Given two strings s and t, write a function to determine if t is an anagram of s.
- Leetcode: Encode and Decode Strings
- Codeforces Round #179 (Div. 2) B. Yaroslav and Two Strings(容斥原理)
- cf Petya and Exam(暴力)
- Codeforces Round #425 (Div. 2) B. Petya and Exam
- CodeForces Petya and Exam
- Codeforces Round #425 (Div. 2) B. Petya and Exam
- [LeetCode#271] Encode and Decode Strings
- Strings in C and C++