C - Vitaly and Strings

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.

Examples
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)，问是否存在ans串使s<ans<t。
需要注意的是知道第几个字符比较出大小后，第一个字符串可能有特殊的’z’，使整个字符串较大；或第二个字符串有’a’，使整个字符串较小。
我这种做法最开始只想着改变字符串t，没想过33-47行，即特殊样例‘czzzzza’、‘daaaaaa’。

#include"stdio.h"
#include"string.h"
#include"math.h"
#include"stdlib.h"
#include"iostream"
#include"cstring"
#include"algorithm"
using namespace std;
int main()
{
	char a[105],b[105];
	while(~scanf("%s %s",a,b))
	{
		int x=strlen(a);
		int flag=0;
		for(int i=x;i>0;i--)
		{
			if(b[i-1]>=98)
			{
				b[i-1]-=1;
				//printf("%s****\n",b);
				if(strcmp(a,b)<0)
				{
					flag=1;
				}
				else
				{
					b[i-1]+=1;
				}
				break;
			}
		}
		if(flag==0)
		{
			for(int i=x;i>0;i--)
			{
				if(a[i-1]<'z')
				{
					a[i-1]+=1;
					if(strcmp(a,b)<0)
					{
						flag=2;
					}
					break;
				}
			}
		}
		if(flag==1)
		{
			printf("%s\n",b);
		}
		else if(flag==2)
		{
			printf("%s\n",a);
		}
		else
		{
			printf("No such string\n");
		}
	}
	return 0;
}