codeforces 518A. Vitaly and Strings

A. Vitaly and Strings

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

input

a
c

output

b

input

aaa
zzz

output

kkk

input

abcdefg
abcdefh

output

No such string

Note

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.

大意是找一个序列长度和s,t的长度相同，并且字典序在s之后，在t之前。

看了数据之后发现有点小坑。

 #include<iostream>
 #include<algorithm>
 #include<cstring>
 #include<iomanip>
 #include<cctype>
 #include<string>
 #include<cmath>
 #include<cstdio>
 #include<cstdlib>
 #define LL long long
 #define PF(x) ((x)*(x))
 #define LF(x) ((x)*PF(x))

 using namespace std;
 const int INF=<<-;
 const int max9=1e9;
 const int max6=1e6;
 const int max3=1e3;

 int gcd(int a,int b)
 {
     return b==?a:gcd(b,a%b);
 }

 int main()
 {
     char str1[],str2[];
     while(cin >> str1 >> str2)
     {
         int len=strlen(str1);
         int flag=;
         int x=len;
         for(int i=len-;i>=;i--)
         {
             if(str1[i]!='z')
             {
                 flag=;
                 str1[i]++;
                 break;
             }
             else str1[i]='a';
         }
         if(flag==||strcmp(str2,str1)<=) cout << "No such string" << endl;
         else cout << str1 << endl;
     }
     return ;
 }