Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.009 s | 1 KBi |
#2 |
Correcto
|
0.008 s | 1 KBi |
#3 |
Correcto
|
0.008 s | 2 KBi |
#4 |
Correcto
|
0.007 s | 2 KBi |
#5 |
Correcto
|
0.006 s | 6 KBi |
#6 |
Correcto
|
0.007 s | 15 KBi |
#7 |
Correcto
|
0.008 s | 13 KBi |
#8 |
Correcto
|
0.005 s | 37 KBi |
#9 |
Correcto
|
0.008 s | 17 KBi |
#10 |
Correcto
|
0.008 s | 16 KBi |
#11 |
Correcto
|
0.005 s | 2 KBi |
#12 |
Correcto
|
0.005 s | 2 KBi |
#include <iostream> #include <vector> #include <algorithm> int main() { std::string word; std::cin >> word; sort(word.begin(), word.end()); for (int i = 0; i < word.size()-1; ++i) { if(word.at(i) == word.at(i+1)) { std::cout << "yes\n"; return 0; } } std::cout << "no\n"; return 0; }