結果
問題 | No.2645 Sum of Divisors? |
ユーザー |
|
提出日時 | 2024-02-19 23:36:41 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 201 ms / 2,000 ms |
コード長 | 5,103 bytes |
コンパイル時間 | 3,798 ms |
コンパイル使用メモリ | 269,236 KB |
実行使用メモリ | 69,752 KB |
最終ジャッジ日時 | 2024-09-29 03:13:45 |
合計ジャッジ時間 | 6,286 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 9 ms
19,016 KB |
testcase_01 | AC | 8 ms
19,024 KB |
testcase_02 | AC | 102 ms
69,220 KB |
testcase_03 | AC | 9 ms
19,064 KB |
testcase_04 | AC | 8 ms
19,060 KB |
testcase_05 | AC | 7 ms
19,020 KB |
testcase_06 | AC | 201 ms
69,252 KB |
testcase_07 | AC | 198 ms
68,508 KB |
testcase_08 | AC | 9 ms
18,956 KB |
testcase_09 | AC | 7 ms
19,244 KB |
testcase_10 | AC | 7 ms
19,264 KB |
testcase_11 | AC | 8 ms
19,060 KB |
testcase_12 | AC | 7 ms
19,128 KB |
testcase_13 | AC | 6 ms
19,220 KB |
testcase_14 | AC | 7 ms
19,128 KB |
testcase_15 | AC | 6 ms
19,228 KB |
testcase_16 | AC | 7 ms
19,352 KB |
testcase_17 | AC | 7 ms
19,084 KB |
testcase_18 | AC | 6 ms
19,384 KB |
testcase_19 | AC | 7 ms
19,332 KB |
testcase_20 | AC | 9 ms
19,344 KB |
testcase_21 | AC | 8 ms
19,480 KB |
testcase_22 | AC | 9 ms
19,728 KB |
testcase_23 | AC | 10 ms
20,592 KB |
testcase_24 | AC | 18 ms
26,120 KB |
testcase_25 | AC | 19 ms
25,336 KB |
testcase_26 | AC | 23 ms
26,616 KB |
testcase_27 | AC | 32 ms
32,696 KB |
testcase_28 | AC | 59 ms
44,828 KB |
testcase_29 | AC | 190 ms
68,268 KB |
testcase_30 | AC | 64 ms
44,124 KB |
testcase_31 | AC | 107 ms
68,440 KB |
testcase_32 | AC | 148 ms
69,752 KB |
testcase_33 | AC | 65 ms
44,336 KB |
testcase_34 | AC | 135 ms
69,136 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) typedef long long int ll; typedef unsigned long long ul; typedef long double ld; typedef vector<int> vi; typedef vector<long long> vll; typedef vector<char> vc; typedef vector<string> vst; typedef vector<double> vd; typedef vector<long double> vld; typedef pair<long long, long long> P; template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); } template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); } template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template<class... T> void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } ll n; void input(){ in(n); } ld harmonic_number(ll n){ ld e = 0.5772156649; ld nn = n; return logl(n) + e + 0.5 / nn - 0.08333 / (nn * nn); } template <typename T> vector<tuple<T, T, T>> enumerate_quotients(const T &n){ vector<tuple<T, T, T>> res; for(T l = 1; l <= n;){ const T quotient = n / l; const T r = n / quotient + 1; // [l, r) res.emplace_back(l, r, quotient); l = r; } return res; } void solve(){ ll mx = 1000000; vld s(mx + 1); rep(i, mx){ s[i + 1] = s[i] + (ld) 1 / (ld) (i + 1); } auto h = [&](ll n){ if(n <= mx){ return (ld) s[n]; }else{ return harmonic_number(n); } }; ld ans = 0; for(auto [l, r, q] : enumerate_quotients(n)){ // out(l, r, q); ans += h(q) * (h(r - 1) - h(l - 1)); } out(ans); } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); input(); solve(); }