結果
問題 | No.888 約数の総和 |
ユーザー |
|
提出日時 | 2023-01-18 06:07:13 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 7,609 bytes |
コンパイル時間 | 4,010 ms |
コンパイル使用メモリ | 265,028 KB |
最終ジャッジ日時 | 2025-02-10 04:07:41 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
コンパイルメッセージ
main.cpp:62:9: warning: #pragma once in main file 62 | #pragma once | ^~~~
ソースコード
#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())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 << ")"; returnos; }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); } }#pragma once// Rho::rabin_miller(N) : N が素数かどうかを判定します。(N <= 2^64 なら必ず成功します) O(log N)// Rho::factorial(N) : N について素因数分解をします。O(N^(1/4))// Rho::divisor(N) : N の約数を列挙します。O(N^(1/4) log N)namespace Rho{unsigned long long mul(unsigned long long a, unsigned long long b, const unsigned long long mod) {long long ret = a * b - mod * (unsigned long long)(1.0L / mod * a * b);return ret + mod * (ret < 0) - mod * (ret >= (long long) mod);}bool rabin_miller(unsigned long long n){switch(n){case 0: // fall-throughcase 1: return false;case 2: return true;}if(n % 2 == 0) return false;vector<long long> A = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};unsigned long long s = 0, d = n - 1;while(d % 2 == 0){s++;d >>= 1;}auto modpow = [](unsigned long long x, unsigned long long e, const unsigned long long mod) -> unsigned long long {unsigned long long ret = 1 % mod;x %= mod;while(e > 0){if(e & 1) ret = mul(ret, x, mod);x = mul(x, x, mod);e >>= 1;}return ret;};for(auto a : A){if(a % n == 0) return true;unsigned long long t, x = modpow(a, d, n);if(x != 1){for(t = 0; t < s; ++t){if(x == n - 1) break;x = mul(x, x, n);}if(t == s) return false;}}return true;}mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());unsigned long long FindFactor(unsigned long long n) {if(n == 1 || rabin_miller(n)) return n;if(n % 2 == 0) return 2;unsigned long long c = 1, x = 0, y = 0, t = 0, prod = 2, x0 = 1, q;auto f = [&](unsigned long long X) { return mul(X, X, n) + c;};while (t++ % 128 or __gcd(prod, n) == 1) {if(x == y) c = rng() % (n-1) + 1, x = x0, y = f(x);if((q = mul(prod, max(x, y) - min(x, y), n))) prod = q;x = f(x), y = f(f(y));}return __gcd(prod, n);}vector<unsigned long long> factorize(unsigned long long x) {if(x == 1) return {};unsigned long long a = FindFactor(x), b = x / a;if(a == x) return {a};vector<unsigned long long> L = factorize(a), R = factorize(b);L.insert(L.end(), R.begin(), R.end());return L;}vector<unsigned long long> divisor(unsigned long long x){vector<unsigned long long> factor = Rho::factorize(x);map<unsigned long long, int> countFactor;for(auto x : factor){if(countFactor.count(x) == 0) countFactor[x] = 0;countFactor[x]++;}vector<unsigned long long> ret = {1};for(auto [x, cnt] : countFactor){vector<unsigned long long> tmp;for(auto y : ret){unsigned long long z = y;for(int i = 0; i < cnt + 1; i++){tmp.push_back(z);z *= x;}}ret = tmp;}return ret;}}ll n;void input(){in(n);}void solve(){out(sum(Rho::divisor(n)));}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(20);input();solve();}