Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.007 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.007 s | 1 KBi |
#6 |
Correcto
|
0.007 s | 1 KBi |
#7 |
Correcto
|
0.009 s | 1 KBi |
#8 |
Correcto
|
0.009 s | 1 KBi |
#9 |
Correcto
|
0.008 s | 1 KBi |
#10 |
Correcto
|
0.011 s | 1 KBi |
#11 |
Correcto
|
0.009 s | 1 KBi |
#12 |
Correcto
|
0.01 s | 1 KBi |
#13 |
Correcto
|
0.009 s | 1 KBi |
#14 |
Correcto
|
0.01 s | 1 KBi |
#15 |
Incorrecto
|
0.008 s | 1 KBi |
#16 |
Incorrecto
|
0.01 s | 1 KBi |
#17 |
Correcto
|
0.008 s | 1 KBi |
#18 |
Incorrecto
|
0.008 s | 1 KBi |
#19 |
Incorrecto
|
0.011 s | 1 KBi |
#20 |
Incorrecto
|
0.007 s | 1 KBi |
#21 |
Incorrecto
|
0.01 s | 1 KBi |
#22 |
Correcto
|
0.01 s | 1 KBi |
#include <iostream> #include <cstring> #include <cstdio> #include <cmath> #include <queue> #include <set> #include <map> #include <vector> #include <stack> #include <algorithm> #define forn(a, n) for(int a = 0; a<(int) (n); ++a) #define rforn(a, n) for(int a = (n)-1; a>=0; --a) using namespace std; const int N = 6e5+20; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); string s; cin>>s; if(s.size() == 0 || s.size() == 1) { cout<<0<<endl; return 0; } int i = 0; int lleva = 0; for(int j = 1; j < s.size(); j++) { if(s[i] == s[j]) { for(int k = i; k < s.size()-1; i++, j++, k++) { if(s[i] != s[j]) {break; lleva = 0;} lleva++; } } } if(lleva==s.size()) lleva++; cout<<lleva<<endl; return 0; }