提出 #55609926

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/modint>
#include <boost/multiprecision/cpp_int.hpp>

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>>;

    const std::vector<std::pair<Num, Num>> dyxs {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

    template<typename T>
    void print_oneline(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << (((i+1) == size) ? '\n' : ' ');
        }
    }

    template<typename T>
    void print_each(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << '\n';
        }
    }
}

template <typename T=__int128>
Num power(Num base, Num index, Num mod) {
    const Num x = base % mod;
    if (x == 0) {
        return 0;
    }

    if (x == 1) {
        return 1;
    }

    T acc {1};
    T doubled = x;
    auto i = index;

    while(i > 0) {
        if ((i & 1) != 0) {
            acc *= doubled;
            acc %= mod;
        }

        doubled *= doubled;
        doubled %= mod;
        i /= 2;
    }

    return static_cast<Num>(acc);
}

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

    while(t-- > 0) {
        Num n,m,k;
        is >> n >> m >> k;

        if ((k + 1) == m) {
            if (n >= k) {
                os << "0\n";
            } else {
                os << power(2, n, 10) << "\n";
            }
        } else {
            const Num w = m - k;
            if (n >= m) {
                const Num r = (n - (m - 1) + w - 1) / w;
                n -= r * w;
            }
            os << power(2, n, 10) << "\n";
        }
    }
}

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

提出情報

ジャッジ結果