結果
問題 | No.2007 Arbitrary Mod (Easy) |
ユーザー |
![]() |
提出日時 | 2022-07-15 21:22:39 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 5,690 bytes |
コンパイル時間 | 1,675 ms |
コンパイル使用メモリ | 170,120 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-27 16:43:52 |
合計ジャッジ時間 | 3,968 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
#pragma region header#include <bits/stdc++.h>using namespace std;// #include <atcoder/all>// using namespace atcoder;/* alias */using ull = unsigned long long;using ll = long long;using pii = pair<int, int>;using pll = pair<ll, ll>;using vi = vector<int>;using vll = vector<long long>;using vd = vector<double>;using vs = vector<string>;using vb = vector<bool>;using vpii = vector<pair<int, int>>;using vpll = vector<pair<ll, ll>>;using vvi = vector<vector<int>>;using vvll = vector<vector<long long>>;using vvd = vector<vector<double>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;/* define */#define MOD 998244353// #define MOD 1000000007#define INF (1LL << 60)#define inf (1 << 28)#define elif else if#define pb push_back#define pf push_front#define fi first#define se second#define all(obj) (obj).begin(), (obj).end()#define YESNO(bool) cout << (bool ? "YES\n" : "NO\n")#define YesNo(bool) cout << (bool ? "Yes\n" : "No\n")#define yesno(bool) cout << (bool ? "yes\n" : "no\n")template<class T> bool chmax(T &a, const T &b) {if(a<b){ a=b; return 1;} return 0;}template<class T> bool chmin(T &a, const T &b) {if(b<a){ a=b; return 1;} return 0;}#define debug(x) cerr << #x << ":" << x << "\n";/* REP macro */#define reps(i, a, n) for(int i = (a); i < (n); i++)#define rep(i, n) reps(i, 0, (n))#define rrep(i, n) reps(i, 1, (n + 1))#define repd(i, n) for(int i = (n - 1); i >= 0; i--)#define rrepd(i, n) for(int i = (n); i >= 1; i--)#define fore(i, a) for(auto &i: a)/* vector */template<class T> T vmax(vector<T> &array){ T ret = array[0]; for(T a: array) chmax(ret, a); return ret; }template<class T> T vmin(vector<T> &array){ T ret = array[0]; for(T a: array) chmin(ret, a); return ret; }template<class T> T sum(vector<T> &array){ T ret = 0; for(T a:array) ret += a; return ret; }template<class T> void list_set(vector<T> &array){ sort(all(array)); array.erase(unique(all(array)),array.end()); }template<class T> T bisect_left(vector<T> &array, T key){ return lower_bound(all(array),key) - array.begin(); }template<class T> T bisect_right(vector<T> &array, T key){ return upper_bound(all(array),key) - array.begin(); }/* string */ll string_to_ll(string n){ ll ret = 0, k = 1; while(n.length() > 0){ ret += k * (n.back() - '0'); n.pop_back(); k *= 10; } return ret; }string ll_to_string(ll n){ string ret = ""; while(n > 0){ ret.pb((n % 10) + '0'); n /= 10; } reverse(all(ret)); return ret; }struct popopo{ popopo(){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(15); }; } popopoppo;#pragma endregion header// https://github.com/Kyo-s-s/Kyo_s_s_Library/blob/main/md/Modint.mdtemplate<int m> struct StaticModint{using mint = StaticModint;public:static constexpr int mod() { return m; }static mint raw(int v) {mint x;x._v = v;return x;}StaticModint() : _v(0) {}template <class T>StaticModint(T v) {long long x = (long long)(v % (long long)(umod()));if (x < 0) x += umod();_v = (unsigned int)(x);}unsigned int val() const { return _v; }mint& operator++() {_v++;if (_v == umod()) _v = 0;return *this;}mint& operator--() {if (_v == 0) _v = umod();_v--;return *this;}mint operator++(int) {mint result = *this;++*this;return result;}mint operator--(int) {mint result = *this;--*this;return result;}mint& operator+=(const mint& rhs) {_v += rhs._v;if (_v >= umod()) _v -= umod();return *this;}mint& operator-=(const mint& rhs) {_v -= rhs._v;if (_v >= umod()) _v += umod();return *this;}mint& operator*=(const mint& rhs) {unsigned long long z = _v;z *= rhs._v;_v = (unsigned int)(z % umod());return *this;}mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }mint operator+() const { return *this; }mint operator-() const { return mint() - *this; }mint pow(long long n) const {assert(0 <= n);mint x = *this, r = 1;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}mint inv() const {assert(_v);return pow(umod() - 2);}friend mint operator+(const mint& lhs, const mint& rhs) {return mint(lhs) += rhs;}friend mint operator-(const mint& lhs, const mint& rhs) {return mint(lhs) -= rhs;}friend mint operator*(const mint& lhs, const mint& rhs) {return mint(lhs) *= rhs;}friend mint operator/(const mint& lhs, const mint& rhs) {return mint(lhs) /= rhs;}friend bool operator==(const mint& lhs, const mint& rhs) {return lhs._v == rhs._v;}friend bool operator!=(const mint& lhs, const mint& rhs) {return lhs._v != rhs._v;}friend ostream &operator<<(ostream &os, mint x) {os << x.val();return (os);}private:unsigned int _v;static constexpr unsigned int umod() { return m; }};using Modint998244353 = StaticModint<998244353>;using Modint1000000007 = StaticModint<1000000007>;// using Mint = Modint998244353;using Mint = Modint1000000007;int main(){ll a, n; cin >> a >> n;ll M = 1000000007;Mint ans = a;ans = ans.pow(n);cout << M << endl;cout << ans.val() << endl;}