結果
問題 | No.2902 ZERO!! |
ユーザー | bortik |
提出日時 | 2024-10-02 03:02:48 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,957 bytes |
コンパイル時間 | 5,862 ms |
コンパイル使用メモリ | 286,240 KB |
実行使用メモリ | 14,104 KB |
最終ジャッジ日時 | 2024-10-02 03:03:24 |
合計ジャッジ時間 | 33,991 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | TLE | - |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 290 ms
5,760 KB |
testcase_05 | AC | 825 ms
8,488 KB |
testcase_06 | TLE | - |
testcase_07 | AC | 385 ms
6,820 KB |
testcase_08 | TLE | - |
testcase_09 | AC | 1,871 ms
12,724 KB |
testcase_10 | AC | 1,258 ms
10,424 KB |
testcase_11 | AC | 925 ms
9,108 KB |
testcase_12 | AC | 52 ms
6,820 KB |
testcase_13 | AC | 1,948 ms
12,908 KB |
testcase_14 | AC | 1,350 ms
10,760 KB |
testcase_15 | AC | 1,592 ms
11,660 KB |
testcase_16 | AC | 760 ms
8,128 KB |
testcase_17 | AC | 1,851 ms
12,740 KB |
testcase_18 | AC | 1,756 ms
12,140 KB |
testcase_19 | AC | 1,484 ms
11,404 KB |
testcase_20 | AC | 1,175 ms
10,148 KB |
testcase_21 | AC | 1,305 ms
10,616 KB |
testcase_22 | AC | 486 ms
6,948 KB |
testcase_23 | AC | 821 ms
8,448 KB |
testcase_24 | AC | 2 ms
6,820 KB |
testcase_25 | AC | 3 ms
6,820 KB |
testcase_26 | AC | 2 ms
6,820 KB |
testcase_27 | AC | 2 ms
6,820 KB |
testcase_28 | AC | 2 ms
6,816 KB |
testcase_29 | AC | 2 ms
6,816 KB |
testcase_30 | AC | 2 ms
6,816 KB |
testcase_31 | AC | 2 ms
6,820 KB |
testcase_32 | AC | 2 ms
6,820 KB |
testcase_33 | AC | 2 ms
6,816 KB |
testcase_34 | AC | 2 ms
6,820 KB |
testcase_35 | AC | 2 ms
6,820 KB |
testcase_36 | AC | 2 ms
6,820 KB |
testcase_37 | AC | 2 ms
6,824 KB |
testcase_38 | AC | 2 ms
6,820 KB |
testcase_39 | AC | 2 ms
6,820 KB |
testcase_40 | AC | 2 ms
6,816 KB |
testcase_41 | AC | 2 ms
6,816 KB |
testcase_42 | AC | 2 ms
6,816 KB |
testcase_43 | AC | 2 ms
6,824 KB |
ソースコード
// https://codeforces.com/blog/entry/96344 //#pragma GCC optimize("O3,unroll-loops") //#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #include <bits/stdc++.h> using namespace std; using ll = long long; using u32 = unsigned int; using u64 = unsigned long long; #if __cplusplus >= 202002L using i128 = __int128; using u128 = unsigned __int128; using f128 = __float128; #endif template<typename T> bool chmax(T& a, const T& b) { bool res = a < b; a = max(a, b); return res; } template<typename T> bool chmin(T& a, const T& b){ bool res = a > b; a = min(a, b); return res; } typedef vector<long long> vl; typedef pair<ll,ll> pll; typedef vector<pair<ll, ll>> vll; typedef vector<int> vi; typedef vector<pair<int,int>> vii; typedef pair<int,int> pii; const int inf = 1000000009; const ll linf = 4000000000000000009; // https://trap.jp/post/1224/ template<class... T> void input(T&... a){ (cin >> ... >> a); } void print(){ cout << '\n'; } template<class T, class... Ts> void print(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template <typename T> T floor(T a, T b) { return a / b - (a % b && (a ^ b) < 0); } template <typename T> T ceil(T x, T y) { return floor(x + y - 1, y); } int popcnt(int x) { return __builtin_popcount(x); } int popcnt(u32 x) { return __builtin_popcount(x); } int popcnt(ll x) { return __builtin_popcountll(x); } int popcnt(u64 x) { return __builtin_popcountll(x); } int popcnt_mod_2(int x) { return __builtin_parity(x); } int popcnt_mod_2(u32 x) { return __builtin_parity(x); } int popcnt_mod_2(ll x) { return __builtin_parityll(x); } int popcnt_mod_2(u64 x) { return __builtin_parityll(x); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2) int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2) int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template<typename T, typename U> T SUM(const vector<U> &A){ T ret = 0; for (auto &&a: A) ret += a; return ret; } #define rep1(a) for(int i = 0; i < a; i++) #define rep2(i, a) for(int i = 0; i < a; i++) #define rep3(i, a, b) for(int i = a; i < b; i++) #define rep4(i, a, b, c) for(int i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b) for(int i = a; i >= b; i--) #define eb emplace_back #define mp make_pair #define mt make_tuple #define fi first #define se second #define all(v) v.begin(), v.end() //--------------------------------- const ll MOD = 998244353; vector<pll> factorize(ll n) { vector<pll> res; for(int i = 2; i*i <= n; i++){ if(n%i == 0){ ll cnt = 0; while(n%i==0){ cnt++; n /= i; } res.push_back(mp(i, cnt)); } } if(n > 1) res.push_back(mp(n, 1)); return res; } void solve(){ ll N; cin >> N; ll ans = 0; unordered_map<ll, ll> cnt; rep(i, 2, N+1) { auto facts = factorize(i); for(auto [f, num]: facts) cnt[f] += num; } vl states(N+1, 1); for(auto [f, num]: cnt){ for(int i = 1; num / i > 0; i++){ states[i] *= num / i + 1; states[i] %= MOD; } } rep(i, N+1){ ans += states[i] - 1; ans %= MOD; } print(ans); } int main(){ ios::sync_with_stdio(false); cin.tie(0); int t = 1; //cin >> t; rep(i,0,t) solve(); }