結果
問題 | No.403 2^2^2 |
ユーザー |
|
提出日時 | 2016-07-23 00:06:20 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,690 bytes |
コンパイル時間 | 1,558 ms |
コンパイル使用メモリ | 168,588 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-06 15:20:47 |
合計ジャッジ時間 | 2,607 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
#include "bits/stdc++.h"using namespace std;#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))#define rep(i,j) FOR(i,0,j)#define each(x,y) for(auto &(x):(y))#define mp make_pair#define all(x) (x).begin(),(x).end()#define debug(x) cout<<#x<<": "<<(x)<<endl#define smax(x,y) (x)=max((x),(y))#define smin(x,y) (x)=min((x),(y))#define MEM(x,y) memset((x),(y),sizeof (x))#define sz(x) (int)(x).size()typedef long long ll;typedef pair<int, int> pii;typedef vector<int> vi;typedef vector<ll> vll;template<int MOD>class ModInt{public:ModInt():value(0){}ModInt(long long val):value((int)(val<0?MOD+val%MOD:val%MOD)){ }ModInt& operator+=(ModInt that){value = value+that.value;if(value>=MOD)value-=MOD;return *this;}ModInt& operator-=(ModInt that){value -= that.value;if(value<0)value+=MOD;return *this;}ModInt& operator*=(ModInt that){value = (int)((long long)value * that.value % 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 operator^(long long k) const{ModInt n = *this, res = 1;while(k){if(k & 1)res *= n;n *= n;k >>= 1;}return res;}ModInt inverse() const {long long a = value, 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);}int toi() const{ return value; }private:int value;};typedef ModInt<1000000007> mint;ostream& operator<<(ostream& os, const mint& x){os << x.toi();return os;}ll powMod(ll n, ll k, ll mod){n %= mod;ll res = 1;while(k){if(k&1)res=res*n%mod;n=n*n%mod;k>>=1;}return res;}const int MD = (int)1e9 + 7;int main(){ll a, b, c;scanf("%lld^%lld^%lld", &a, &b, &c);{mint ans = a;ans = ans^b;ans = ans^c;cout << ans << ' ';}{if(a%MD == 0){cout << 0 << endl;} else{mint ans = a;ll x = powMod(b, c, MD - 1);ans = ans ^ x;cout << ans << endl;}}}