結果

問題 No.251 大きな桁の復習問題(1)
ユーザー snteasntea
提出日時 2017-10-05 21:43:23
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 5,000 ms
コード長 3,700 bytes
コンパイル時間 1,546 ms
コンパイル使用メモリ 168,992 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-16 21:29:35
合計ジャッジ時間 2,199 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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

#ifdef LOCAL111
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { cout << '(' << p.first << ' ' << p.second << ')'; return os;
    }
template<long long MOD>
class ModInt {
public:
const static long long mod = MOD;
long long x;
ModInt() {
x = 0;
}
ModInt(long long x) {
x %= mod;
this->x = x < 0 ? x+mod : x;
}
int get() const {
return (int)x;
}
ModInt &operator+=(ModInt that) {
if((x += that.get()) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(ModInt that) {
if((x += mod-that.get()) >= mod) x -= mod;
return *this;
}
ModInt &operator*=(ModInt that) {
x = x*that.get()%mod;
return *this;
}
ModInt &operator/=(ModInt that) {
return *this *= that.inverse();
}
ModInt operator+(ModInt that) const {
return ModInt(*this) += that;
}
ModInt operator-(ModInt that) const {
return ModInt(*this) -= that;
}
ModInt operator*(ModInt that) const {
return ModInt(*this) *= that;
}
ModInt operator/(ModInt that) const {
return ModInt(*this) /= that;
}
ModInt inverse() const {
using std::swap;
long long a = x, b = mod, u = 1, v = 0;
while(b) {
long long t = a/b;
a -= t*b; swap(a,b);
u -= t*v; swap(u,v);
}
return ModInt(u);
}
ModInt pow(int n) const{
ModInt b = *this;
ModInt res = 1;
while(n != 0) {
if(n&1){
res *= b;
}
b *= b;
n >>= 1;
}
return res;
}
bool operator==(ModInt that) const { return x == that.get(); }
bool operator!=(ModInt that) const { return x != that.get(); }
ModInt operator-() const { return x == 0 ? 0 : ModInt(mod-x); }
};
template<long long MOD> ostream& operator<< (ostream& os, const ModInt<MOD>& m) { cout << m.get(); return os; }
template<long long MOD> istream& operator>> (istream& is, ModInt<MOD>& m){ long long n; cin >> n; m = n; return is;}
typedef ModInt<129402307> mint;
using mint0 = ModInt<129402307-1>;
#define endl '\n'
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
#define DEBUG(x) true
template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;
void ios_init(){
//cout.setf(ios::fixed);
//cout.precision(12);
#ifdef LOCAL111
return;
#endif
ios::sync_with_stdio(false); cin.tie(0);
}
int main()
{
ios_init();
const long long mod = 129402307;
string ns, ms;
while(cin >> ns >> ms) {
if(ms == "0") {
cout << 1 << endl;
continue;
}
DEBUG(ns); DEBUG(ms);
mint n = 0;
REP(i, SZ(ns)) {
n *= 10;
n += ns[i]-'0';
}
mint0 m = 0;
REP(i, SZ(ms)) {
m *= 10;
m += ms[i]-'0';
DEBUG(ms[i]-'0');
}
DEBUG(n); DEBUG(m);
if(n.get() == 0) {
cout << 0 << endl;
} else {
cout << n.pow(m.get()) << endl;
}
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0