Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.068 s | 16 KBi |
#2 |
Incorrecto
|
0.117 s | 19 KBi |
#3 |
Incorrecto
|
0.059 s | 16 KBi |
#4 |
Incorrecto
|
0.103 s | 13 KBi |
#5 |
Incorrecto
|
0.113 s | 14 KBi |
#6 |
Incorrecto
|
0.116 s | 14 KBi |
#7 |
Incorrecto
|
0.123 s | 15 KBi |
#8 |
Incorrecto
|
0.11 s | 13 KBi |
#9 |
Incorrecto
|
0.064 s | 16 KBi |
#10 |
Incorrecto
|
0.11 s | 14 KBi |
#11 |
Incorrecto
|
0.07 s | 16 KBi |
#12 |
Incorrecto
|
0.06 s | 16 KBi |
class Main { public static void main(String[] args) { java.util.Scanner inp = new java.util.Scanner(System.in); String word = inp.nextLine(); String letters[] = word.split(""); boolean found = false; for(int i = 0; i < letters.length; i++) { for(int j = 0; j < letters.length; j++) { if(i == j){ continue; } else if(letters[i].equals(letters[j])) { found = true; break; } } } if(found) System.out.print("Yes"); else System.out.print("No"); } }