Codeforces Round #397(Div. 1 + Div. 2 combined)B. Code obfuscation【水题】

B. Code obfuscation
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

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".

Examples
Input
abacaba
Output
YES
Input
jinotega
Output
NO
Note

In the first sample case, one possible list of identifiers would be "number string number character number string number". Here how Kostya would obfuscate the program:

  • replace all occurences of number with a, the result would be "a string a character a string a",
  • replace all occurences of string with b, the result would be "a b a character a b a",
  • replace all occurences of character with c, the result would be "a b a c a b a",
  • all identifiers have been replaced, thus the obfuscation is finished.

题目大意:

现在给你一个已经混淆了的字符串,问你是否能够是通过某种字符串得到的。

混淆字符串的机制:对于原串来讲,对于第一种出现的字符,全部替代为a.对于第二种出现的字符,全部替代为b.................依次类推。


思路:


对于出现字母的顺序,肯定是a.b.c.d.e............才是YES的字符串。

那么对于当前字符,如果是之前没出现过的,那么必须是出现过的最大的字母顺序+1才行。


Ac代码:

#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{
    char a[505];
    int vis[505];
    while(~scanf("%s",a))
    {
        memset(vis,0,sizeof(vis));
        int n=strlen(a);
        int now=1;
        int flag=0;
        for(int i=0;i<n;i++)
        {
            if(vis[i]==0)
            {
                if(now!=a[i]-'a'+1)flag=1;
                else
                {
                    for(int j=i;j<n;j++)
                    {
                        if(a[j]==a[i])vis[j]++;
                    }
                }
                now++;
            }
        }
        if(flag==1)printf("NO\n");
        else printf("YES\n");
    }
}








阅读更多
版权声明:0.0小白有写的不好不对的地方请指出~ https://blog.csdn.net/mengxiang000000/article/details/55105686
文章标签: Codeforces#397
个人分类: 水题
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭