#778126 (C++17) No.2007 Arbitrary Mod (Easy)

提出ソース

結果

問題	No.2007 Arbitrary Mod (Easy)
ユーザー	Zaurus
提出日時	2022-07-15 21:21:42
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	11 ms / 2,000 ms
コード長	5,019 bytes
コンパイル時間	2,373 ms
コンパイル使用メモリ	204,012 KB
実行使用メモリ	11,092 KB
最終ジャッジ日時	2023-09-10 00:18:36
合計ジャッジ時間	6,328 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	10 ms 11,092 KB
testcase_01	AC	11 ms 10,760 KB
testcase_02	AC	11 ms 10,816 KB
testcase_03	AC	11 ms 10,860 KB
testcase_04	AC	11 ms 10,892 KB
testcase_05	AC	11 ms 10,940 KB
testcase_06	AC	11 ms 10,932 KB
testcase_07	AC	10 ms 11,024 KB
testcase_08	AC	11 ms 10,976 KB
testcase_09	AC	11 ms 10,972 KB
testcase_10	AC	10 ms 11,072 KB
testcase_11	AC	11 ms 10,848 KB
testcase_12	AC	10 ms 10,864 KB
testcase_13	AC	10 ms 10,956 KB
testcase_14	AC	11 ms 11,008 KB
testcase_15	AC	10 ms 11,072 KB
testcase_16	AC	10 ms 10,848 KB
testcase_17	AC	10 ms 11,004 KB
testcase_18	AC	10 ms 10,968 KB
testcase_19	AC	10 ms 10,904 KB
testcase_20	AC	11 ms 10,888 KB
testcase_21	AC	10 ms 11,028 KB
testcase_22	AC	10 ms 11,012 KB
testcase_23	AC	10 ms 10,916 KB
testcase_24	AC	10 ms 11,036 KB
testcase_25	AC	10 ms 11,000 KB
testcase_26	AC	11 ms 10,868 KB
testcase_27	AC	11 ms 10,912 KB
testcase_28	AC	10 ms 11,092 KB
testcase_29	AC	11 ms 10,876 KB
testcase_30	AC	10 ms 11,032 KB
testcase_31	AC	11 ms 11,028 KB
testcase_32	AC	10 ms 10,904 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define br cout << '\n';
using namespace std;
const long long INF = 8e18;
using Graph = vector<vector<ll>>;
template<class T> inline bool chmin(T &a, T b) { if(a > b){ a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b) { if(a < b){ a = b; return true;} return false;}
ll ceilll(ll a, ll b) {return (a + b-1) / b;} // if(a%b != 0) (a/b) + 1
ll get_digit(ll a) {ll digit = 0; while(a != 0){a /= 10; digit++;} return digit;} // a != 0
template<typename T> void vecdbg(vector<T>& v){ rep(i, v.size()){cerr << v[i] << ' ';} cerr << '\n';}
template<typename T> void vecvecdbg(vector<vector<T>>& v){ rep(i, v.size()){rep(j, v[i].size()){cerr << v[i][j] << ' ';} cerr << '\n';}}
ll POW(ll a, ll n){ ll res = 1; while(n > 0){ if(n & 1){ res = res * a; } a *= a; n >>= 1; } return res; }
using P = pair<ll, ll>;
const double PI = acos(-1);

// 0 false, 1 true 
// string number to int : -48 or - '0'
// a to A : -32
// ceil(a)  1.2->2.0
// c++17	g++ -std=c++17 a.cpp
// global vector -> 0 initialization
// DONT FORGET TO INTIALIZE
// The type of GRID is CHAR. DONT USE STRING
// If the result in local and judge is different, USE CODETEST!!
// (a * b)over flow?   if(a > INF / b){ /* overflow */}

//https://atcoder.jp/contests/abc172/submissions/14765570
//20200724
template<long long mod>
struct ModInt
{
    long long x;
    ModInt () : x(0) {}
    ModInt (long long x) : x(x >= 0 ? x % mod : (mod - -x % mod) % mod) {}
    ModInt &operator += (const ModInt &p){
        if ((x += p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator -= (const ModInt &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator *= (const ModInt &p) {
        x = (long long) x * p.x % mod;
        return *this;
    }
    ModInt &operator /= (const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }
    ModInt &operator ^= (long long p) {
        ModInt res = 1;
        for (; p; p >>= 1) {
            if (p & 1) res *= *this;
            *this *= *this;
        }
        return *this = res;
    }
    ModInt operator - () const { return ModInt(-x); }
    ModInt operator + (const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator - (const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator * (const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator / (const ModInt &p) const { return ModInt(*this) /= p; }
    ModInt operator ^ (long long p) const { return ModInt(*this) ^= p; }
    bool operator == (const ModInt &p) const { return x == p.x; }
    bool operator != (const ModInt &p) const { return x != p.x; }
    explicit operator long long() const { return x; }
    ModInt &operator = (const long long p) { x = p; return *this;}
    ModInt inverse() const {
        long long a = x, b = mod, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            a -= t * b;
            std::swap(a, b);
            u -= t * v;
            std::swap(u, v);
        }
        return ModInt(u);
    }
    friend std::ostream & operator << (std::ostream &stream, const ModInt<mod> &p) {
        return stream << p.x;
    }
    friend std::istream & operator >> (std::istream &stream, ModInt<mod> &a) {
        long long x;
        stream >> x;
        a = ModInt<mod>(x);
        return stream;
    }
};

template<long long mod> struct MComb {
    using mint = ModInt<mod>;
    std::vector<mint> fact;
    std::vector<mint> inv;
    MComb (long long n) { // O(n + log(mod))
        fact = std::vector<mint>(n + 1, 1);
        for (long long i = 1; i <= n; i++) fact[i] = fact[i - 1] * mint(i);
        inv.resize(n + 1);
        inv[n] = fact[n] ^ (mod - 2);
        for (long long i = n; i--; ) inv[i] = inv[i + 1] * mint(i + 1);
    }
    mint ncr(long long n, long r) {
        return fact[n] * inv[r] * inv[n - r];
    }
    mint npr(long n, long r) {
        return fact[n] * inv[n - r];
    }
    //nhr : n : shikiri + 1, r : tamanokazu
    mint nhr(long n, long r) {
        assert(n + r - 1 < (long long) fact.size());
        return ncr(n + r - 1, r);
    }
};

template<long long mod> struct MPow {
    using mint = ModInt<mod>;
    mint modpow(mint a, long long n) {
        mint res = 1;
            while(n > 0){
            if(n & 1){
                res = res * a;
            }
            a = a * a;
            n >>= 1;
        }
        return res;
    }
};

#define MOD 998244353

typedef ModInt<MOD> mint;
MComb<MOD> com(510000); // com.ncr(n, r) n < r の値入れちゃダメ nprも nhrは入れていい
MPow<MOD> mpow;

int main() {
    std::cout << std::fixed << std::setprecision(15);
    ll a, n; cin >> a >> n;
    ll m = 998244353;
    cout << m << endl;
    cout << mpow.modpow(a, n) << endl;

}

yukicoder

結果

テストケース

ソースコード