Submission #3247664

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int N, M;
    cin >> N >> M;
    map<int, int> rems;
    int tmp;
    long long acc = 0;
    int rem;
    for (int i = 0; i < N; ++i) {
        cin >> tmp;
        acc += tmp;
        rem = static_cast<int>(acc % M);
        if (rems.find(rem) == rems.end()) {
            rems.insert(make_pair(rem, 0));
        }
        rems[rem]++;
    }
    
    long long total = 0;
    for (auto &r : rems) {
        int rem = r.first;
        int count = r.second;
        total += (count - 1) * count / 2;
        if (rem == 0) total += count;
    }

    printf("%lld", total);
    // cout << total << '\n';

    return 0;
}

Submission Info

Judge Result