fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4. #define int ll
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "div"
  33.  
  34. const int MOD = 998244353;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 1e7 + 5;
  38. int n, k;
  39.  
  40. void init(void) {
  41.     cin >> n >> k;
  42.     if (n == 1) {
  43.         cout << 1;
  44.         exit(0);
  45.     }
  46. }
  47.  
  48. void process(void) {
  49.     int val = 0;
  50.     int tmp = n;
  51.     int i = 2;
  52.     vector<ii> primes;
  53.     while(i * i <= n) {
  54.         if (n % i == 0) {
  55.             int cnt = 0;
  56.             while(n % i == 0) cnt++, n /= i;
  57.             primes.pb(mp(i, cnt));
  58.         }
  59.         i++;
  60.     }
  61.  
  62.     if (n > 1) val++, primes.pb(mp(n, 1));
  63.  
  64.     n = tmp;
  65.  
  66.     auto power = [&](int x, int k, int m) {
  67.         int res = 1;
  68.         while(k) {
  69.             if (k & 1) res = 1LL * res * x % m;
  70.             k >>= 1;
  71.             x = 1LL * x * x % m;
  72.         }
  73.         return res;
  74.     };
  75.  
  76.     int ans = 1;
  77.     for(ii p : primes)
  78.         ans = 1LL * ans * ((power(p.fi, 1LL * p.se * power(2, k, MOD - 1) % (MOD - 1) + 1, MOD) - power(p.fi, p.se, MOD) + MOD) % MOD)
  79.                     % MOD * power(p.fi - 1, MOD - 2, MOD) % MOD;
  80.     cout << ans;
  81. }
  82.  
  83. signed main() {
  84.     ios_base::sync_with_stdio(0);
  85.     cin.tie(0); cout.tie(0);
  86.     if (fopen(task".inp", "r")) {
  87.         freopen(task".inp", "r", stdin);
  88.         freopen(task".out", "w", stdout);
  89.     }
  90.     int tc = 1;
  91. //     cin >> tc;
  92.     while(tc--) {
  93.         init();
  94.         process();
  95.     }
  96.     return 0;
  97. }
  98.  
Success #stdin #stdout 0.01s 5312KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1
https://ideone.com/lqiFlp
language:
C++14 (gcc 8.3)
created:
7 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!