提出 #48781034

---

ソースコード 拡げる

#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 a, m, l, r;
    is >> a >> m >> l >> r;
    l -= a;
    r -= a;

    Num left {l};
    if (l < 0) {
        left += std::abs(l) % m;
    } else {
        left += (m - std::abs(l) % m) % m;
    }

    Num right {r};
    if (r < 0) {
        right -= (m - std::abs(r) % m) % m;
    } else {
        right -= std::abs(r) % m;
    }

    Num answer {0};
    if (left <= right) {
        answer = 1 + ((right - left) / m);
    }

    os << answer << "\n";
}

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

提出情報

ジャッジ結果