CF 293 A. Vitaly and Strings

http://codeforces.com/contest/518/problem/A

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串字母序小的字符串p   s,t,p长度一样。  p不存在输出 No such string

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#include <stack>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;

using namespace std;

bool cmp(int a,int b)
{
    return a>b;
}

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    //freopen("out.txt","w",stdout);
    char s[120],t[120];
    int i;
    scanf("%s%s",s,t);
    int l=strlen(s);
    for(i=0;i<l;i++)
	{
		if(t[i]-s[i]>0)
		{
			for(int j=l-1;j>=i;j--)
				if(s[j]<'z')
				{
					s[j]=(char)(s[j]+1);break;
				}
				else s[j]='a';
			break;
		}
	}
	if(!strcmp(s,t))printf("No such string\n");
		else printf("%s\n",s);
    return 0;
}
/*
abczz
abdab
*/