Submission #10747581


Source Code Expand

Copy
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;

#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a)  (a).begin(),(a).end()

template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}

void solve() {
    int N,P;
    cin >> N >> P;
    string S;
    cin >> S;
    if (P==2 || P==5) {
        ll res = 0;
        REP(i,N) if ((S[N-i-1]-'0')%P == 0) res += N-i;
        cout << res << endl;
        return;
    }


    map<ll,ll> mp;
    // a_0は0なのでその分を考慮する。
    mp[0] = 1;
    ll tenfactor = 1,cur = 0;
    REP(i,N) {
        cur = (cur + (S[N-i-1] - '0') * tenfactor) % P;
        tenfactor = (tenfactor * 10) % P;
        if (mp.count(cur) == 0) mp[cur] = 0;
        mp[cur]++;
    }

    ll res = 0;
    for(const auto &it: mp) res += (it.second*(it.second-1))/2;
    cout << res << endl;
}

int main() {
    solve();
    return 0;
}

Submission Info

Submission Time
Task E - Divisible Substring
User reud
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1285 Byte
Status AC
Exec Time 51 ms
Memory 1028 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 44
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 2 ms 256 KB
07.txt AC 2 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 2 ms 256 KB
10.txt AC 2 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 1 ms 256 KB
14.txt AC 1 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 2 ms 256 KB
17.txt AC 3 ms 512 KB
18.txt AC 3 ms 384 KB
19.txt AC 3 ms 512 KB
20.txt AC 3 ms 512 KB
21.txt AC 51 ms 1028 KB
22.txt AC 34 ms 640 KB
23.txt AC 49 ms 900 KB
24.txt AC 36 ms 640 KB
25.txt AC 35 ms 640 KB
26.txt AC 10 ms 640 KB
27.txt AC 9 ms 640 KB
28.txt AC 10 ms 640 KB
29.txt AC 10 ms 640 KB
30.txt AC 8 ms 640 KB
31.txt AC 8 ms 640 KB
32.txt AC 9 ms 640 KB
33.txt AC 14 ms 640 KB
34.txt AC 9 ms 640 KB
35.txt AC 15 ms 640 KB
36.txt AC 27 ms 644 KB
37.txt AC 31 ms 900 KB
38.txt AC 29 ms 644 KB
39.txt AC 31 ms 900 KB
40.txt AC 30 ms 772 KB
41.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB