結果

問題 No.2007 Arbitrary Mod (Easy)
ユーザー null
提出日時 2022-07-15 21:21:38
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 5,022 bytes
コンパイル時間 9,008 ms
コンパイル使用メモリ 443,256 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-27 16:40:48
合計ジャッジ時間 11,995 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

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

/*
このコード、と～おれ!
Be accepted!
∧＿∧　
（｡･ω･｡)つ━☆・*。
⊂　　 ノ 　　　・゜+.
　しーＪ　　　°。+ *´¨)
        　　.· ´¸.·*´¨) ¸.·*¨)
          　　　　　　　　　　(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#include <iomanip>
#include <set>
#include <stack>
#include <bitset>
#include <array>
#include <chrono>
//#pragma GCC target("arch=skylake-avx512")
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define repeat(i, n, m) for(int i = n; i < (m); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a)
#define printLdb(a) printf("%.50Lf\n", a)
#define printdbd(a) printf("%.16lf\n", a)
#define prints(s) printf("%s\n", s.c_str())
#define all(x) (x).begin(), (x).end()
#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)
#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d))
using ll = long long;
using ull = unsigned long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1e9 + 7;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-14;
const long double PI = acosl(-1.0L);
using namespace std;
void scans(string& str) {
    char c;
    str = "";
    scanf("%c", &c);
    if (c == '\n')scanf("%c", &c);
    while (c != '\n' && c != -1 && c != ' ') {
        str += c;
        scanf("%c", &c);
    }
}
void scanc(char& str) {
    char c;
    scanf("%c", &c);
    if (c == -1)return;
    while (c == '\n') {
        scanf("%c", &c);
    }
    str = c;
}
double acot(double x) {
    return PI / 2 - atan(x);
}
ll LSB(ll n) { return (n & (-n)); }
template<typename T>
inline T chmin(T& a, const T& b) {
    if (a > b)a = b;
    return a;
}
template<typename T>
inline T chmax(T& a, const T& b) {
    if (a < b)a = b;
    return a;
}
//cpp_int
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace boost::multiprecision;
#else
using cpp_int = ll;
#endif
//atcoder library
#if __has_include(<atcoder/all>)
#include <atcoder/all>
//using namespace atcoder;
#endif
/*
    random_device seed_gen;
    mt19937 engine(seed_gen());
    uniform_int_distribution dist(1, 100);
*/
/*----------------------------------------------------------------------------------*/
/*
* @title modint
* @docs kyopro/docs/modint.md
*/
template<int mod>
struct modint {
    int val;
    modint() : val(0) {};
    modint(ll x) : val(x >= 0 ? x % mod : (mod + x % mod) % mod) {};
    modint& operator=(const modint& x) {
        val = x.val;
        return *this;
    }
    modint& operator+=(const modint& x) {
        val += x.val;
        if (val >= mod)val -= mod;
        return *this;
    }
    modint& operator-=(const modint& x) {
        val += mod - x.val;
        if (val >= mod)val -= mod;
        return *this;
    }
    modint& operator*=(const modint& x) {
        val = (int)((ll)val * (ll)x.val % mod);
        return *this;
    }
    modint& operator/=(const modint& x) {
        int a = x.val, b = mod, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        *this *= modint(u);
        return *this;
    }
    modint operator++() {
        val = (val + 1 == mod ? 0 : val + 1);
        return *this;
    }
    modint operator--() {
        val = (val == 0 ? mod - 1 : val - 1);
        return *this;
    }
    modint operator+(const modint& x) const {
        return (modint(*this) += x);
    }
    modint operator-(const modint& x) const {
        return (modint(*this) -= x);
    }
    modint operator*(const modint& x) const {
        return (modint(*this) *= x);
    }
    modint operator/(const modint& x) const {
        return (modint(*this) /= x);
    }
    bool operator==(const modint& x)const {
        return (val == x.val);
    }
    bool operator!=(const modint& x)const {
        return (val != x.val);
    }
    bool operator<(const modint& x)const {
        return (val < x.val);
    }
    bool operator>(const modint& x)const {
        return (val > x.val);
    }
    modint pow(ll n) {
        modint ret(1), a(val);
        while (n > 0) {
            if (n % 2) ret *= a;
            a *= a;
            n /= 2;
        }
        return ret;
    }
    static int getmod() { return mod; };
};
using ModInt = modint<MOD>;
using Modint = modint<mod>;
int main() {
    int a;
    ll n;
    scanf("%d%lld", &a, &n);
    Modint ans = a;
    ans = ans.pow(n);
    printf("998244353\n%d\n", ans.val);
    Please AC;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0