結果
| 問題 | No.403 2^2^2 |
| ユーザー |
 koyumeishi
|
| 提出日時 | 2016-07-22 23:46:11 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 22 ms / 2,000 ms |
| コード長 | 7,580 bytes |
| コンパイル時間 | 1,311 ms |
| コンパイル使用メモリ | 113,852 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-11-06 15:18:02 |
| 合計ジャッジ時間 | 2,500 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 27 |
ソースコード
/*### ############## ################################################################################################################################################ ##################################### ####### ############################ ################# ################### # ########################## ######### ################################### # ########################### ############## ################################ ######### ################################### ####### ###################################### # ####### ################################################ ################################################ ################################################ ############################################## ########################################## ################################# ######################### ################ ######## ### ## # ## # # # # # #### #### #### #### ##### # # # # ## # # # # # # #____# ### #/ # # ## # # # # # # # #^^^^ ### ###/# # # # #### #### ###/# #### ####*/#include <iostream>#include <vector>#include <cstdio>#include <sstream>#include <map>#include <string>#include <algorithm>#include <queue>#include <cmath>#include <functional>#include <set>#include <ctime>#include <random>#include <chrono>#include <cassert>using namespace std;namespace {using Integer = __int128;template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}template<class T> istream& operator , (istream& is, T& val){ return is >> val;}template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;}template<class H> void print(const H& head){ cout << head; }template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }template<class H> void eprint(const H& head){ cerr << head; }template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }class range{long long start_, end_, step_;public:struct range_iterator{long long val, step_;range_iterator(long long v, long long step) : val(v), step_(step) {}long long operator * (){return val;}void operator ++ (){val += step_;}bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;}};range(long long len) : start_(0), end_(len), step_(1) {}range(long long start, long long end) : start_(start), end_(end), step_(1) {}range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {}range_iterator begin(){ return range_iterator(start_, step_); }range_iterator end(){ return range_iterator( end_, step_); }};string operator "" _s (const char* str, size_t size){ return move(string(str)); }constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexedmt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());template<class T> string join(const vector<T>& v, const string& sep){stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();}string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }}constexpr long long mod = 9_ten + 7;Integer power_mod(Integer x, Integer y, Integer mod){Integer ret = 1;while(y){if(y&1) ret = (ret*x) % mod;x = (x*x) % mod;y >>= 1;}return ret;}//find k such that x^k = y (mod z)//x and z are co-prime//x^(aH-b) = y (mod z)//x^aH = y * x^b (mod z)Integer baby_step_giant_step(Integer x, Integer y, long long z){Integer H = sqrt(z) + 1;set<pair<int,Integer>> S;for(Integer i=0, w=y; i<H; i++, w=(w*x)%z){S.insert({w,i});}Integer k = -1;Integer x_H = power_mod(x, H, z);for(Integer i=1, w=x_H; i<=H; i++, w=(w*x_H)%z){auto itr = S.lower_bound({w+1, 0});if(itr == S.begin()) continue;itr--;if(itr->first == w){return H * i - itr->second;}}return k;}Integer get_order(Integer a, Integer b){return baby_step_giant_step(a, 1, b);}int main(){string s;cin >> s;s += '^';vector<Integer> v(3, 0);for(int i=0, k=0; i<3; k++){while(s[k] != '^'){v[i] = v[i] * 10 + (s[k] - '0');k++;}i++;}v[0] %= mod;if(v[0] == 0){println(0,0);return 0;}if(v[0] == 1){println(1,1);return 0;}Integer ord_a = get_order(v[0], mod);Integer ans_1 = my_pow_mod(v[0] % mod, v[1], mod);ans_1 = my_pow_mod(ans_1, v[2], mod);Integer ans_2 = my_pow_mod(v[0] % mod, my_pow_mod(v[1] % ord_a, v[2], ord_a), mod);println((long long)ans_1, (long long)ans_2);return 0;}