Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 2 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.007 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 2 KBi |
#5 |
Correcto
|
0.008 s | 9 KBi |
#6 |
Correcto
|
0.004 s | 2 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.004 s | 1 KBi |
#9 |
Correcto
|
0.004 s | 2 KBi |
#10 |
Correcto
|
0.006 s | 1 KBi |
#11 |
Correcto
|
0.004 s | 2 KBi |
#12 |
Correcto
|
0.004 s | 2 KBi |
#include <bits/stdc++.h> using namespace std; int main(){ string word; cin >> word; unordered_set<char> used; bool f = true; for(char a: word){ if(used.count(a)){ f = false; break;} else used.insert(a); } cout << (f? "no" : "yes"); return 0; }