Description
Kostya likes Codeforces contests very much. However, he is very disappointed that his solutions are frequently hacked. That's why he decided to obfuscate (intentionally make less readable) his code before upcoming contest.
To obfuscate the code, Kostya first looks at the first variable name used in his program and replaces all its occurrences with a single symbol a, then he looks at the second variable name that has not been replaced yet, and replaces all its occurrences with b, and so on. Kostya is well-mannered, so he doesn't use any one-letter names before obfuscation. Moreover, there are at most 26 unique identifiers in his programs.
You are given a list of identifiers of some program with removed spaces and line breaks. Check if this program can be a result of Kostya's obfuscation.
Input
In the only line of input there is a string S of lowercase English letters (1 ≤ |S| ≤ 500) — the identifiers of a program with removed whitespace characters.
Output
If this program can be a result of Kostya's obfuscation, print "YES" (without quotes), otherwise print "NO".
Sample Input
Input
abacaba
Output
YES
Input
jinotega
Output
NO
题目大意:给出一个字符串,每一个字母都要小于等于前面的最大值加一,否则输出NO(第一个必须是a)
#include <stdio.h>
#include <string.h>
int main()
{
char e[1000];
int i,p=0,max,x;
while(gets(e))
{
x=0;
p=strlen(e);
if(e[0]!='a')
{
printf("NO\n");
continue;
}
max=e[0];
for(i=0;i<p;i++)
{
if(e[i]<max+1)
continue;
else
if(e[i]==max+1)
max+=1;
else
{
x=1;
break;
}
}
if(x==0)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}