| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 146854 | hjx22333 | 统计回文子串 | C++ | Wrong Answer | 0 MS | 272 KB | 559 | 2026-02-01 00:09:27 |
#include <bits/stdc++.h> using namespace std; int main() { char a[5001]; int t,i,j,m,s; scanf("%d",&t); while(t--) { scanf("%s",a); int len=strlen(a); vector<vector<int > > b(len, vector<int>(len, 0)); i=0; while(i<strlen(a)) { b[i][i]=1; i++; } s=len; m=2; while(m<=len) { i=0; while(i<=len-m) { j=i+m-1; if(a[i]==a[j]) { if(m==2 or b[i+1][j-1]==1) { b[i][j]=1; s++; } } i++; } m++; } printf("%d\n",s); } return 0; }
------Input------
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
------Answer-----
12502500 12502500 12502500 12502500 12502500 12502500 12502500 12502500 12502500 5 30 1
------Your output-----