Code : Finding the number of palindromes (Large)

#include <bits/stdc++.h> using namespace std; // Template starts #include <codeforces/modint.hpp> // Template ends constexpr int md = (int)10007; using mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>; void solve(string &str) { int n = str.length(); vector<vector<mint>> dp(n, vector<mint>(n, 0)); // dp[i][j] is the number of non-empty palindromic subsequence of [i...j]. // Fill all length 1 manually. for (int i = 0; i < n; i++) { dp[i][i] = 1; } for (int i = n - 2; i >= 0; i--) { for (int j = i + 1; j < n; j++) { // You can always choose to delete one of the endpoints.