Advertisement
esraa_syam

no comment

Mar 27th, 2023
104
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.65 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. #define nl "\n"
  3. #define fi first
  4. #define se second
  5. #define pi 3.14159
  6. #define ll long long
  7. #define odd(a)  (a&1)
  8. #define even(a)  !(a&1)
  9. #define Mod 1'000'000'007
  10. #define INF 2'000'000'000
  11. #define sz(x) int(x.size())
  12. #define charToInt(s) (s - '0')
  13. #define ull unsigned long long
  14. #define number_line iota(all(vec) , 1)
  15. #define all(s) s.begin(), s.end()
  16. #define rall(v) v.rbegin() , v.rend()
  17. #define fixed(n) fixed << setprecision(n)
  18. #define Num_of_Digits(n) ((int)log10(n) + 1)
  19. #define to_decimal(bin) stoll(bin, nullptr, 2)
  20. #define Ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  21. #define Floor(n, m) (((n) / (m)) - ((n) % (m) ? 0 : 1))
  22. #define Upper(s) transform(all(s), s.begin(), ::toupper);
  23. #define Lower(s) transform(all(s), s.begin(), ::tolower);
  24. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
  25. //  ----- bits-------
  26. #define pcnt(n) __builtin_popcount(n)  
  27. #define pcntll(n) __builtin_popcountll(n)
  28. #define clz(n) __builtin_clz(n)    // <---100
  29. #define clzll(n) __builtin_clzll(n)
  30. #define ctz(n) __builtin_ctz(n)  // 0001---->
  31. #define ctzll(n) __builtin_ctzll(n)
  32.  
  33. using namespace std;
  34.  
  35. template < typename T = int > istream& operator >> (istream &in, vector < T > & v){
  36.     for(auto & x : v) in >> x;
  37.     return in;
  38. }
  39.  
  40. template < typename T = int > ostream& operator << (ostream &out, const vector < T > & v){
  41.     for(const T & x : v) out << x << " ";
  42.     return out;
  43. }
  44.  
  45. void esraa()
  46. {
  47.     //freopen("shuffle.in", "r", stdin), freopen("shuffle.out", "w", stdout);
  48.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  49. #ifndef ONLINE_JUDGE
  50.     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  51. #endif
  52. }
  53. ll bin_exp(ll a, ll b , ll mod = 998244353){
  54.     ll res = 1;
  55.     while(b){
  56.         if(b & 1) res = (res * a) % mod;
  57.         a = (a * a) % mod;
  58.         b >>= 1;
  59.     }
  60.     return res;
  61. }
  62. void solve(){
  63.     int n;
  64.     cin >> n;
  65.     vector < pair < int , int > > v;
  66.     for(int i = 1 ; i <= sqrt(n) ; i++){
  67.         if(n % i == 0){  
  68.             v.push_back({n / i , i});
  69.         }
  70.     }
  71.     int x = v[0].fi , y = v[0].se;
  72.     double curr = x * log(y);
  73.     for(int i = 0 ; i < sz(v) ; i++){
  74.         if(v[i].fi * log(v[i].se) > curr){
  75.             curr = v[i].fi * log(v[i].se);
  76.             x = v[i].fi , y = v[i].se;
  77.         }
  78.         if(v[i].se * log(v[i].fi) > curr){
  79.             curr = v[i].se * log(v[i].fi);
  80.             x = v[i].se , y = v[i].fi;
  81.         }
  82.     }
  83.     cout << bin_exp(y , x) << nl;
  84. }
  85. int main()
  86. {
  87.     esraa();
  88.     int t = 1;
  89.     cin >> t;
  90.     //cin.ignore();
  91.     while(t--)
  92.       solve();
  93.     return 0;
  94. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement