Submission #5035812

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <stack> // s.top()
#include <bitset>
#include <queue> // s.front()
using namespace std;

typedef long long Int;
typedef pair<Int,Int> P;
#define print(x) cout<<(x)<<endl

#define INF10 10000000000
#define INF5 100000
#define EPS 1e-10
#define MOD 1000000007


int main() {
	string S;
	cin >> S;
	for (int i = 0; i < S.size(); i++) {
		for (int j = i + 1; j < S.size(); j++) {
			if (S[i] == S[j]) {
				print("no");
				return 0;
			}
		}
	}
	print("yes");


	return 0;
}

Submission Info

Judge Result