Submission #29317661

---

Source Code Expand

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
// using mint = modint1000000007;
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
// using P = pair<ll,ll>;
using P = pair<int,int>;
using vint = vector<int>;
using vll = vector<ll>;
using vvint = vector<vector<int>>;
using vvll = vector<vector<ll>>;

// const ll INF = (ll)2e18+9;
const int INF = (int)2e9+7;
// const ll MOD = (ll)1e9+9;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

template<typename T>
void print(vector<T> v) {
    int n = v.size();
    rep(i,n) {
        if (i == 0) cout << v[i];
        else cout << ' ' << v[i];
    }
    cout << endl;
}

map<ll,mint> mp;

mint f(ll x) {
    if (0 < x && x <= 3) {
        return x;
    }

    if (mp.count(x)) return mp[x];

    mp[x/2] = f(x/2);
    mp[(x+1)/2] = f((x+1)/2);

    return mp[x] = mp[x/2] * mp[(x+1)/2];
}

void solve() {
    ll x;
    cin >> x;

    cout << f(x).val() << endl;
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result