Submission #54371709

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<numeric>
#include<bitset>
#include<queue>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(x)  cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(x,a) for(auto& (x) : (a) )
#define ENDL cout<<endl
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<numeric>
#include<bitset>
#include<queue>

#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(x)  cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(x,a) for(auto& (x) : (a) )
#define ENDL cout<<endl
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECCOUT(x) for(auto&youso_: (x) )cout<<youso_<<" ";cout<<endl
#define pb(a) push_back(a)
#define mp make_pair
#define mt make_tuple

#define mll map<long long,long long>
#define msl map<string,long long>
#define pll pair<long long, long long>
#define qll queue<long long>
#define pqll priority_queue<long long>
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vvll vector<vector<long long>>

using ll = long long;
using ull = unsigned long long;
using namespace std;

const ll MOD = 998244353;
const ll INF = 1e17;

ll modpow(ll a, ll b) {
    ll result = 1;
    while (b > 0) {
        if (b % 2 == 1) {
            result = result * a % MOD;
        }
        a = a * a % MOD;
        b /= 2;
    }
    return result;
}

ll modinv(ll a) {
    ll b = MOD, u = 1, v = 0;
    while (b) {
        ll t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= MOD;
    if (u < 0) u += MOD;
    return u;
}

int main() {
    ll n;
    cin >> n;
    ll len = to_string(n).size();

    ll n_mod = n % MOD;
    ll power_term = modpow(modpow(10, len), n) - 1;
    if (power_term < 0) power_term += MOD;
    ll inv_term = modinv(modpow(10, len) - 1);
    if (inv_term < 0) inv_term += MOD;

    ll result = n_mod * power_term % MOD * inv_term % MOD;
    cout << result << endl;

    return 0;
}

Submission Info

Judge Result