結果
問題 | No.2902 ZERO!! |
ユーザー | TKTYI |
提出日時 | 2024-09-27 21:54:24 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,330 ms / 2,000 ms |
コード長 | 3,394 bytes |
コンパイル時間 | 7,867 ms |
コンパイル使用メモリ | 283,384 KB |
実行使用メモリ | 100,292 KB |
最終ジャッジ日時 | 2024-09-27 21:54:56 |
合計ジャッジ時間 | 25,702 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
19,088 KB |
testcase_01 | AC | 27 ms
19,204 KB |
testcase_02 | AC | 1,330 ms
100,292 KB |
testcase_03 | AC | 26 ms
19,200 KB |
testcase_04 | AC | 186 ms
38,864 KB |
testcase_05 | AC | 488 ms
59,356 KB |
testcase_06 | AC | 1,224 ms
98,932 KB |
testcase_07 | AC | 275 ms
43,564 KB |
testcase_08 | AC | 1,116 ms
97,600 KB |
testcase_09 | AC | 1,075 ms
97,708 KB |
testcase_10 | AC | 768 ms
89,372 KB |
testcase_11 | AC | 534 ms
60,244 KB |
testcase_12 | AC | 55 ms
23,168 KB |
testcase_13 | AC | 1,125 ms
97,656 KB |
testcase_14 | AC | 805 ms
74,212 KB |
testcase_15 | AC | 922 ms
76,472 KB |
testcase_16 | AC | 437 ms
58,988 KB |
testcase_17 | AC | 1,049 ms
96,340 KB |
testcase_18 | AC | 989 ms
78,380 KB |
testcase_19 | AC | 838 ms
76,008 KB |
testcase_20 | AC | 694 ms
88,940 KB |
testcase_21 | AC | 777 ms
89,672 KB |
testcase_22 | AC | 295 ms
46,912 KB |
testcase_23 | AC | 457 ms
58,816 KB |
testcase_24 | AC | 26 ms
19,240 KB |
testcase_25 | AC | 26 ms
19,332 KB |
testcase_26 | AC | 24 ms
19,120 KB |
testcase_27 | AC | 28 ms
19,212 KB |
testcase_28 | AC | 26 ms
19,292 KB |
testcase_29 | AC | 24 ms
19,252 KB |
testcase_30 | AC | 27 ms
19,144 KB |
testcase_31 | AC | 26 ms
19,176 KB |
testcase_32 | AC | 26 ms
19,172 KB |
testcase_33 | AC | 26 ms
19,224 KB |
testcase_34 | AC | 30 ms
19,084 KB |
testcase_35 | AC | 25 ms
19,288 KB |
testcase_36 | AC | 25 ms
19,240 KB |
testcase_37 | AC | 26 ms
19,192 KB |
testcase_38 | AC | 26 ms
19,148 KB |
testcase_39 | AC | 26 ms
19,172 KB |
testcase_40 | AC | 29 ms
19,132 KB |
testcase_41 | AC | 27 ms
19,224 KB |
testcase_42 | AC | 26 ms
19,260 KB |
testcase_43 | AC | 25 ms
19,172 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector<ll> vi; typedef vector<vi> vvi; typedef vector<vvi> vvvi; typedef vector<vvvi> vvvvi; typedef vector<bool> vb; typedef vector<vb> vvb; typedef vector<vvb> vvvb; typedef vector<vvvb> vvvvb; typedef pair<ll,ll> pi; typedef pair<ll,pi> ppi; typedef pair<ll,ppi> pppi; typedef pair<ll,pppi> ppppi; #define FOR(i,l,r) for(ll i=l;i<r;i++) #define REP(i,n) FOR(i,0,n) #define RFOR(i,l,r) for(ll i=r-1;i>=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) /* #include<boost/multiprecision/cpp_int.hpp> namespace mp=boost::multiprecision; using Bint=mp::cpp_int; */ template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>; template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;} template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;} template<typename T>ostream&operator<<(ostream&os,vector<T>v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;} template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;} template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;} template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;} ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));} vi fast_mod_convolution(vi&a,vi&b,ll mod){ const ll m1=167772161,m2=469762049,m3=1224736769; const ll m1_inv_m2=inv_mod(m1,m2); const ll m12_inv_m3=inv_mod(m1*m2,m3); const ll m12_mod=m1*m2%mod; auto x=convolution<m1>(a,b); auto y=convolution<m2>(a,b); auto z=convolution<m3>(a,b); vector<ll>ret(sz(a)+sz(b)-1); REP(i,sz(ret)){ ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2; ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3; ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod; } return ret; } const ld EPS=1e-8; //* using mint=modint998244353; const ll mod=998244353; //*/ /* using mint=modint1000000007; const ll mod=1000000007; //*/ //using mint=modint; //* typedef vector<mint> vm; typedef vector<vm> vvm; typedef vector<vvm> vvvm; typedef vector<vvvm> vvvvm; ostream&operator<<(ostream&os,mint a){os<<a.val();return os;} istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ int main(){ vector<bool>prime(2e6,1); prime[0]=prime[1]=0; FOR(i,2,2e6)if(prime[i])for(ll j=i*i;j<2e6;j+=i)prime[j]=0; ll N;cin>>N; vi T(2e6); REP(i,2e6)if(prime[i]){ ll n=N; while(n)n/=i,T[i]+=n; } vvi Q; REP(i,2e6)if(T[i]){ vi V; RFOR(j,1,T[i]+1)V.emplace_back(T[i]/j); V.emplace_back(1e9); Q.emplace_back(V); } vi X; REP(i,sz(Q))for(auto j:Q[i])X.emplace_back(j); sort(ALL(X)); X.erase(unique(ALL(X)),X.end()); vm Y; for(auto x:X){ mint s=1; REP(i,sz(Q))s*=sz(Q[i])-LB(Q[i],x); Y.emplace_back(s); } //REP(i,sz(X))cout<<X[i]<<" "<<Y[i]<<endl; REP(i,sz(Y)-1)Y[i]-=Y[i+1]; //REP(i,sz(X))cout<<X[i]<<" "<<Y[i]<<endl; mint ans=0; REP(i,sz(X)-1)ans+=X[i]*Y[i]; cout<<ans<<endl; return 0; }