fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. string a;
  31.  
  32. int consistency(int n){
  33.  
  34. vector<vector<bool>> dp(n, vector<bool>(n, false));
  35.  
  36. int ct = 0;
  37.  
  38. for(int len=1; len<=n; len++){
  39. for(int i=0, j=len-1; j<n; i++, j++){
  40. if(len==1){
  41. dp[i][j] = true;
  42. ct++;
  43. }
  44. else if(len == 2){
  45. if(a[i] == a[j]){
  46. dp[i][j] = true;
  47. ct++;
  48. }
  49. }
  50. else{
  51. if(a[i] == a[j] && dp[i+1][j-1]){
  52. dp[i][j] = true;
  53. ct++;
  54. }
  55. }
  56. }
  57. }
  58.  
  59. return ct;
  60. }
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76. int practice(int n){
  77.  
  78.  
  79. return 0;
  80. }
  81.  
  82.  
  83.  
  84.  
  85.  
  86. void solve() {
  87.  
  88. cin >> a;
  89. int n = a.size();
  90.  
  91. cout << consistency(n) << endl;
  92.  
  93.  
  94. }
  95.  
  96.  
  97.  
  98.  
  99.  
  100. int32_t main() {
  101. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  102.  
  103. int t = 1;
  104. // cin >> t;
  105. while (t--) {
  106. solve();
  107. }
  108.  
  109. return 0;
  110. }
Success #stdin #stdout 0s 5320KB
stdin
longtimenosee
stdout
14