Codeforces Round #293 (Div. 2)--A-- Vitaly and Strings - Painting
2015-06-10 11:28
453 查看
小水,WA了几次,其实不用想太多,因为str1的字典序题目中说肯定比str2的小,所以只要让str1的字典序加上1即可,所以要倒着循环,如果最后是z就要考虑进位的因素。最后在比较一下,str1 != str2 就输出就行了!!!
Description
Vitaly is a diligent student who never missed a lesson in his five years of studying in the university. He always does his homework on time and passes his exams in time.
During the last lesson the teacher has provided two strings s and t to Vitaly. The strings have the same length, they consist of lowercase
English letters, string s is lexicographically smaller than string t. Vitaly wondered if there is such string that is lexicographically
larger than string s and at the same is lexicographically smaller than string t. This string should also consist of lowercase English
letters and have the length equal to the lengths of strings s and t.
Let's help Vitaly solve this easy problem!
Input
The first line contains string s (1 ≤ |s| ≤ 100), consisting of lowercase English letters. Here, |s| denotes
the length of the string.
The second line contains string t (|t| = |s|), consisting of lowercase English letters.
It is guaranteed that the lengths of strings s and t are the same and string s is
lexicographically less than string t.
Output
If the string that meets the given requirements doesn't exist, print a single string "No such string" (without the quotes).
If such string exists, print it. If there are multiple valid strings, you may print any of them.
Sample Input
Input
Output
Input
Output
Input
Output
Hint
String s = s1s2... sn is said to be lexicographically smaller than t = t1t2... tn,
if there exists such i, that s1 = t1, s2 = t2, ... si - 1 = ti - 1, si < ti.
Description
Vitaly is a diligent student who never missed a lesson in his five years of studying in the university. He always does his homework on time and passes his exams in time.
During the last lesson the teacher has provided two strings s and t to Vitaly. The strings have the same length, they consist of lowercase
English letters, string s is lexicographically smaller than string t. Vitaly wondered if there is such string that is lexicographically
larger than string s and at the same is lexicographically smaller than string t. This string should also consist of lowercase English
letters and have the length equal to the lengths of strings s and t.
Let's help Vitaly solve this easy problem!
Input
The first line contains string s (1 ≤ |s| ≤ 100), consisting of lowercase English letters. Here, |s| denotes
the length of the string.
The second line contains string t (|t| = |s|), consisting of lowercase English letters.
It is guaranteed that the lengths of strings s and t are the same and string s is
lexicographically less than string t.
Output
If the string that meets the given requirements doesn't exist, print a single string "No such string" (without the quotes).
If such string exists, print it. If there are multiple valid strings, you may print any of them.
Sample Input
Input
a c
Output
b
Input
aaa zzz
Output
kkk
Input
abcdefg abcdefh
Output
No such string
Hint
String s = s1s2... sn is said to be lexicographically smaller than t = t1t2... tn,
if there exists such i, that s1 = t1, s2 = t2, ... si - 1 = ti - 1, si < ti.
#include<cstdio> #include<algorithm> #include<cmath> #include<iostream> #include<cstdlib> #include<string> #include<string.h> using namespace std; string str1; string str2; int main() { cin>>str1>>str2; int len = str1.length(); for(int i = len -1; i >= 0 ; i--) { if(str1[i] != 'z') { str1[i] = str1[i] + 1; break; } if(str1[i] == 'z') str1[i] = 'a'; } if(str1 != str2) cout<<str1<<endl; else cout<<"No such string"<<endl; return 0; }
相关文章推荐
- 人工智能的JAVA实现
- AIX查看CPU及内存参数
- Flash/ActionScript 解决跨域问题的策略文件crossdomain.xml的写法
- 3 Main Benefits of Project Baselining
- Climbing Stairs
- 应用环境下的TIME_WAIT和CLOSE_WAIT处理
- head,tail,cat,more,less
- head,tail,cat,more,less
- DetailCheckoutActivity
- 数据防灾的TurboMail邮件系统部署方案
- IBM X3650 M3 7945XJ9 Raid10 配置
- Add Again(重复元素排序) UVA11076
- There is an overlap in the region chain修复
- There is an overlap in the region chain
- 480000 millis timeout while waiting for channel to be ready for write异常处理
- http://musicbusiness.baijia.baidu.com/article/76737
- Add Again(重复元素排序)
- pip install lxml 报错error: command 'gcc' failed wit
- LightOJ1021---Painful Bases (状压dp)
- LightOJ 1038 - Race to 1 Again 【DP】