# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22903 | imsifile | New Ocurrences (KRIII5_NO) | C++98 | 63 ms | 200452 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#include<string.h>
char st[101010]; int N;
long long dy[5050][5050], sum;
int main(){
scanf("%s", st+1); N=strlen(st+1);
for(int i=1; i<=N; i++){
for(int j=1; j<i; j++){
if(st[i]==st[j])dy[i][j] = 1+dy[i-1][j-1];
else dy[i][j]=0;
}
}
for(int i=1; i<=N; i++){
for(int j=1; j<i; j++)sum += dy[i][j]*2;
sum += i;
printf("%lld\n", sum);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |