Vitaly and Strings
来源:互联网 发布:球球霸屏软件 编辑:程序博客网 时间:2024/05/20 03:41
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, strings is lexicographically smaller than stringt. Vitaly wondered if there is such string that is lexicographically larger than strings and at the same is lexicographically smaller than stringt. This string should also consist of lowercase English letters and have the length equal to the lengths of stringss 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 andt 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
ac
b
aaazzz
kkk
abcdefgabcdefh
No such string
Sample Output
Hint
String s = s1s2...sn is said to be lexicographically smaller thant = t1t2...tn, if there exists such i, that s1 = t1, s2 = t2, ...si - 1 = ti - 1, si < ti.
#include <iostream>#include<algorithm>#include<cstdio>#include<cmath>#include<cstring>#include<cstdlib>using namespace std;int main(){ char a[105], b[105]; int i, j = 0, n; scanf("%s%s", a, b); n = strlen(a); a[n - 1]++; for (i = n - 1; i >= 0; i--) { if (a[i] > 'z') { a[i] = 'a'; a[i - 1]++; } } for (i = 0; i < n; i++) { if (a[i] == b[i]) j++; } if (j == n) printf("No such string\n"); else printf("%s", a); return 0;}
- Vitaly and Strings
- A. Vitaly and Strings
- A. Vitaly and Strings
- A. Vitaly and Strings
- Vitaly and Strings
- ACdream 1056 Vitaly and Strings
- CF 518A(Vitaly and Strings-构造)
- codeforces 293 dvi2 A. Vitaly and Strings
- codeforces 518A Vitaly and Strings
- 518A - Vitaly and Strings【string】
- CF(#293 div2):A:Vitaly and Strings
- [CodeForces518A]Vitaly and Strings[字符串][构造]
- CF 293 A. Vitaly and Strings
- CodeForces 518A Vitaly and Strings
- Codeforces Round #293 (Div. 2)A. Vitaly and Strings
- Codeforces Round #293 (Div. 2) -- A. Vitaly and Strings
- CodeForces - 518A Vitaly and Strings(水题)
- 【Code Forces】518A Vitaly and Strings(思维题)
- Link/Cut Tree
- 安卓开发 画一条竖线
- Android AIDL demo
- poj 3190 Stall Reservations(贪心)
- 给出两个字符串,找到最长公共子序列(LCS),返回LCS的长度。C实现
- Vitaly and Strings
- git入门教程
- hdu 4864 Task【贪心】
- 数据库性能
- Java 日期格式是“Fri Feb 26 16:33:08 CST 2016”字符串类型,转date类型。java.util.date与sql.date的相互转换
- 修改Android Studio Build生成apk的默认名称
- iOS开发调用系统通讯录获取电话号码
- Unity获取场景gameobject的路径
- C#内部类