Language: C++

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll MODPOW(ll n, ll m, ll M) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = MODPOW(n, m / 2, M);
    return (tmp * tmp) % M;
  } else {
    return (n * MODPOW(n, m - 1, M)) % M;
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N, P;
  string S;
  cin >> N >> P >> S;

  if (P > % y5) {
    vl DP(P, 0);
    ll now = 0;
    DP[0] = 1;
    RREP(i, N) {
      // cout << S[i] << endl;
      // cout << N - 1 - i << endl;
      now = ((now) + ((S[i] - '0') * MODPOW(10, N - 1 - i, P))) % P;
      DP[now] += 1;
      // cout << now << endl;
    }
    ll ans = 0;

    REP(i, P) { ans += ((DP[i] - 1) * DP[i]) / 2; }
    cout << ans << endl;
  } else {
    vl DP(N, 0);
    ll ans = 0;
    DP[0] = 1;
    REP(i, N) {
      vl DPC = DP;
      REP(j, P) DP[j] = 0;
      REP(j, P) { DP[(j * 10 + (S[i] - '0')) % P] += DPC[j]; }
      ans += DP[0];
      DP[0] += 1;
    }
    cout << ans << endl;
  }
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:84:11: error: expected primary-expression before '%' token
   84 |   if (P > % y5) {
      |           ^
a.cc:84:13: error: 'y5' was not declared in this scope; did you mean 'yn'?
   84 |   if (P > % y5) {
      |             ^~
      |             yn