結果
問題 | No.2902 ZERO!! |
ユーザー |
|
提出日時 | 2024-10-12 13:40:27 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 281 ms / 2,000 ms |
コード長 | 2,795 bytes |
コンパイル時間 | 2,581 ms |
コンパイル使用メモリ | 211,252 KB |
実行使用メモリ | 80,032 KB |
最終ジャッジ日時 | 2024-10-12 13:40:35 |
合計ジャッジ時間 | 7,854 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 41 |
ソースコード
#include <bits/stdc++.h>using namespace std;long long mod = 998244353;//入力が必ず-mod<a<modの時.struct mint{long long v = 0;mint(){} mint(int a){v = a<0?a+mod:a;} mint(long long a){v = a<0?a+mod:a;}mint(unsigned long long a){v = a;}long long val(){return v;}void modu(){v %= mod;}mint repeat2mint(const long long a,long long b){mint ret = 1,p = a;while(b){if(b&1) ret *= p;p *= p; b >>= 1;}return ret;};mint &operator=(const mint &b) = default;mint operator-() const {return mint(0)-(*this);}mint operator+(const mint b){return mint(v)+=b;}mint operator-(const mint b){return mint(v)-=b;}mint operator*(const mint b){return mint(v)*=b;}mint operator/(const mint b){return mint(v)/=b;}mint operator+=(const mint b){v += b.v; if(v >= mod) v -= mod;return *this;}mint operator-=(const mint b){v -= b.v; if(v < 0) v += mod;return *this;}mint operator*=(const mint b){v = v*b.v%mod; return *this;}mint operator/=(mint b){if(b == 0) assert(false);int left = mod-2;while(left){if(left&1) *this *= b; b *= b; left >>= 1;}return *this;}mint operator++(int){*this += 1; return *this;}mint operator--(int){*this -= 1; return *this;}bool operator==(const mint b){return v == b.v;}bool operator!=(const mint b){return v != b.v;}bool operator>(const mint b){return v > b.v;}bool operator>=(const mint b){return v >= b.v;}bool operator<(const mint b){return v < b.v;}bool operator<=(const mint b){return v <= b.v;}mint pow(const long long x){return repeat2mint(v,x);}mint inv(){return mint(1)/v;}};int main() {ios_base::sync_with_stdio(false);cin.tie(nullptr);int N; cin >> N;int Need = N;vector<bool> prime(Need+1,true);prime.at(0) = false; prime.at(1) = false;for(int i=2; i*i<=Need; i++){if(!prime.at(i)) continue;for(int k=i*i; k<=Need; k+=i) prime.at(k) = false;}vector<mint> inv(Need+1,1);for(int i=2; i<=Need; i++) inv.at(i).v = mod-(mod/i*inv.at(mod%i).v %mod);vector<vector<int>> add(2*N);int sum = 0;for(int i=2; i<=N; i++) if(prime.at(i)){int ap = 0,now = N/i;while(now){ap += now;now /= i;}sum += ap;for(int k=1; k<=ap; k++) add.at(ap/k).push_back(i);}mint all = 1,answer = 0;vector<int> multi(N+1,1);for(int i=N+N-1; i>0; i--) for(auto p : add.at(i)){all *= inv.at(multi.at(p));multi.at(p)++;answer += all*i;all *= multi.at(p);}cout << answer.v << endl;}