提出 #71142094

---

ソースコード 拡げる

#include <bits/stdc++.h>

typedef long long valueType;
typedef std::vector<valueType> ValueVector;
typedef std::vector<ValueVector> ValueMatrix;
typedef std::vector<ValueMatrix> ValueCube;
typedef std::string string;
typedef std::vector<string> StringVector;
typedef std::vector<bool> bitset;
typedef std::vector<bitset> BitMatrix;
typedef std::pair<valueType, valueType> ValuePair;
typedef std::vector<ValuePair> PairVector;
typedef std::vector<PairVector> PairMatrix;
typedef std::tuple<valueType, valueType, valueType> ValueTuple;
typedef std::vector<ValueTuple> TupleVector;
typedef std::vector<TupleVector> TupleMatrix;
typedef std::set<valueType> ValueSet;
typedef std::map<valueType, valueType> ValueMap;
typedef std::vector<ValueMap> MapVector;

valueType GetDigitCount(valueType x) {
    valueType count = 0;

    while (x > 0) {
        x /= 10;
        ++count;
    }

    return count;
}

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

    valueType N, M;

    std::cin >> N >> M;

    ValueVector A(N);

    for (auto &a : A)
        std::cin >> a;

    MapVector Remain(11);

    for (auto const &a : A)
        ++Remain[GetDigitCount(a)][a % M];

    valueType Ans = 0;

    ValueVector Pow10(11, 1);
    for (valueType i = 1; i <= 10; ++i)
        Pow10[i] = (Pow10[i - 1] * 10) % M;

    for (auto const &a : A) {
        for (valueType digi = 1; digi <= 10; ++digi)
            Ans += Remain[digi][(M - (a * Pow10[digi] % M)) % M];
    }

    std::cout << Ans << std::endl;

    return 0;
}

提出情報

ジャッジ結果