結果

問題 No.1161 Many Powers
ユーザー tkmst201
提出日時 2021-01-21 11:04:18
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 72 ms / 2,000 ms
コード長 4,069 bytes
コンパイル時間 1,782 ms
コンパイル使用メモリ 192,728 KB
最終ジャッジ日時 2025-01-18 03:02:57
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//
template<int ID>
struct RuntimeModInt {
public:
    using value_type = int;
    using calc_type = std::int_fast64_t;
    
private:
    value_type val_;
    static int & mod_() noexcept { static int M = 2; return M; }
    
public:
    RuntimeModInt(calc_type val = 0) : val_(val < 0 ? (val % mod() + mod()) % mod() : val % mod()) {}
    const value_type & val() const noexcept { return val_; }
    static void set_mod(int M) noexcept { assert(M > 0); mod_() = M; }
    static int mod() noexcept { return mod_(); }
    
    explicit operator bool() const noexcept { return val_; }
    bool operator !() const noexcept { return !static_cast<bool>(*this); }
    RuntimeModInt operator +() const noexcept { return RuntimeModInt(*this); }
    RuntimeModInt operator -() const noexcept { return RuntimeModInt(-val_); }
    RuntimeModInt operator ++(int) noexcept { RuntimeModInt res = *this; ++*this; return res; }
    RuntimeModInt operator --(int) noexcept { RuntimeModInt res = *this; --*this; return res; }
    RuntimeModInt & operator ++() noexcept { val_ = val_ + 1 == mod() ? 0 : val_ + 1; return *this; }
    RuntimeModInt & operator --() noexcept { val_ = val_ == 0 ? mod() - 1 : val_ - 1; return *this; }
    RuntimeModInt & operator +=(const RuntimeModInt & rhs) noexcept { val_ += val_ < mod() - rhs.val_ ? rhs.val_ : rhs.val_ - mod(); return *this; }
    RuntimeModInt & operator -=(const RuntimeModInt & rhs) noexcept { val_ += val_ >= rhs.val_ ? -rhs.val_ : mod() - rhs.val_; return *this; }
    RuntimeModInt & operator *=(const RuntimeModInt & rhs) noexcept { val_ = static_cast<calc_type>(val_) * rhs.val_ % mod(); return *this; }
    RuntimeModInt & operator /=(const RuntimeModInt & rhs) noexcept { return *this *= rhs.inv(); }
    friend RuntimeModInt operator +(const RuntimeModInt & lhs, const RuntimeModInt & rhs) noexcept { return RuntimeModInt(lhs) += rhs; }
    friend RuntimeModInt operator -(const RuntimeModInt & lhs, const RuntimeModInt & rhs) noexcept { return RuntimeModInt(lhs) -= rhs; }
    friend RuntimeModInt operator *(const RuntimeModInt & lhs, const RuntimeModInt & rhs) noexcept { return RuntimeModInt(lhs) *= rhs; }
    friend RuntimeModInt operator /(const RuntimeModInt & lhs, const RuntimeModInt & rhs) noexcept { return RuntimeModInt(lhs) /= rhs; }
    friend bool operator ==(const RuntimeModInt & lhs, const RuntimeModInt & rhs) noexcept { return lhs.val_ == rhs.val_; }
    friend bool operator !=(const RuntimeModInt & lhs, const RuntimeModInt & rhs) noexcept { return !(lhs == rhs); }
    friend std::ostream & operator <<(std::ostream & os, const RuntimeModInt & rhs) { return os << rhs.val_; }
    friend std::istream & operator >>(std::istream & is, RuntimeModInt & rhs) { calc_type x; is >> x; rhs = RuntimeModInt(x); return is; }
    
    RuntimeModInt pow(calc_type n) const noexcept {
        RuntimeModInt res = 1, x = val_;
        if (n < 0) { x = x.inv(); n = -n; }
        while (n) { if (n & 1) res *= x; x *= x; n >>= 1; }
        return res;
    }
    
    RuntimeModInt inv() const noexcept {
        value_type a = val_, a1 = 1, a2 = 0, b = mod(), b1 = 0, b2 = 1;
        while (b > 0) {
            value_type q = a / b, r = a % b;
            value_type nb1 = a1 - q * b1, nb2 = a2 - q * b2;
            a = b; b = r;
            a1 = b1; b1 = nb1;
            a2 = b2; b2 = nb2;
        }
        assert(a == 1);
        return a1;
    }
};
using mint = RuntimeModInt<-1>;
int main() {
    ll A, B, C;
    cin >> A >> B >> C;
    ll p = A / C, q = A % C;
    mint::set_mod(C);
    mint ans, sum;
    REP(i, C) {
        mint cur = mint(i).pow(B);
        if (i <= q) ans += cur;
        sum += cur;
    }
    ans += sum * p;
    cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0