Submission #4027302

---

Source Code Expand

#ifdef LOCAL
#include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstring>
#else
#include <bits/stdc++.h>
#endif
using namespace std ;

typedef long long ll ;
#define rep(i , n ) for ( int i =0; i < n ; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb push_back
#define DEBUG(x) cout << #x << ": " << x << endl;

/*
__attribute__((constructor))
void initial()
{
	cin.tie(NULL);
	ios::sync_with_stdio(false);
}
*/

int main()
{
	cin.tie(NULL);
	ios::sync_with_stdio(false);

	string s;
	
	cin >> s;

	int a[26];

	memset(a, 0, sizeof(a));

	for (int i = 0; i < s.size(); i++)
	{
		a[s[i] - 'a']++;
		if (a[s[i] - 'a'] > 1)
		{
			cout << "no" << endl;
			return 0;
		}
	}

	cout << "yes" << endl;

	
	return 0;
}

Submission Info

Judge Result