提出 #47463809

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
using ModInt [[maybe_unused]] = atcoder::modint998244353;
using Num [[maybe_unused]] = long long int;
using Vec [[maybe_unused]] = std::vector<Num>;
using Set [[maybe_unused]] = std::set<Num>;
using Mset [[maybe_unused]] = std::multiset<Num>;
using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

template<typename T>
using Q [[maybe_unused]] = std::queue<T>;

template<typename T>
using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    is >> n;

    Num total {0};
    for(Num i{1}; i<=n; ++i) {
        Num d {0};
        is >> d;

        Num key = i % 10;
        if (key == 0) {
            continue;
        }

        bool valid {true};
        Num ri = i;
        while(ri > 0) {
            valid &= (ri % 10) == key;
            ri /= 10;
        }

        if (!valid) {
            continue;
        }

        for(Num j{1}; j<=d; ++j) {
            bool val {true};
            Num rd = j;
            while(rd > 0) {
                val &= (rd % 10) == key;
                rd /= 10;
            }
            total += val + 0;
        }
    }

    os << total << "\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

提出情報

ジャッジ結果