結果

問題 No.403 2^2^2
ユーザー n_vip
提出日時 2016-07-22 22:29:28
言語 C++11
(gcc 4.8.5)
結果
AC  
実行時間 4 ms
コード長 1,869 Byte
コンパイル時間 592 ms
使用メモリ 1,568 KB
最終ジャッジ日時 2019-11-26 11:54:53

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0_sample_01.in AC 3 ms
1,564 KB
0_sample_02.in AC 3 ms
1,568 KB
0_sample_03.in AC 4 ms
1,568 KB
1_small_01.in AC 3 ms
1,568 KB
1_small_02.in AC 3 ms
1,564 KB
1_small_03.in AC 3 ms
1,564 KB
1_small_04.in AC 3 ms
1,564 KB
1_small_05.in AC 3 ms
1,568 KB
1_small_06.in AC 3 ms
1,564 KB
1_small_07.in AC 4 ms
1,568 KB
2_large_01.in AC 3 ms
1,568 KB
2_large_02.in AC 3 ms
1,568 KB
2_large_03.in AC 3 ms
1,564 KB
2_large_04.in AC 3 ms
1,552 KB
2_large_05.in AC 3 ms
1,568 KB
2_large_06.in AC 3 ms
1,556 KB
2_large_07.in AC 3 ms
1,556 KB
2_large_08.in AC 3 ms
1,568 KB
2_large_09.in AC 3 ms
1,568 KB
2_large_10.in AC 3 ms
1,568 KB
2_large_11.in AC 4 ms
1,568 KB
2_large_12.in AC 3 ms
1,564 KB
2_large_13.in AC 3 ms
1,568 KB
2_large_14.in AC 3 ms
1,560 KB
2_large_15.in AC 4 ms
1,568 KB
2_large_16.in AC 3 ms
1,552 KB
2_large_17.in AC 3 ms
1,564 KB
2_large_18.in AC 3 ms
1,564 KB
2_large_19.in AC 3 ms
1,564 KB
challenge01.txt AC 3 ms
1,552 KB
テストケース一括ダウンロード

ソースコード

diff #
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
const ll MOD=1e9+7;
ll modpow(ll r,ll n,ll m=MOD){
  ll re=1,d=r%m;
  //if(n<0)(n%=m-1)+=m-1;
  for(;n;n/=2){
    if(n&1)(re*=d)%=m;
    (d*=d)%=m;
  }
  return re;
}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  ll a,b,c;
  scanf("%lld^%lld^%lld",&a,&b,&c);
  if(a%MOD==0){
    cout<<"0 0"<<endl;
    return 0;
  }
  cout<<modpow(a%MOD,b%(MOD-1)*(c%(MOD-1))%(MOD-1))<<" "
      <<modpow(a%MOD,modpow(b,c,MOD-1))<<endl;
  return 0;
}
0