結果
問題 | No.1260 たくさんの多項式 |
ユーザー | suta28407928 |
提出日時 | 2020-10-17 00:16:45 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 64 ms / 2,000 ms |
コード長 | 4,139 bytes |
コンパイル時間 | 1,557 ms |
コンパイル使用メモリ | 112,460 KB |
実行使用メモリ | 27,264 KB |
最終ジャッジ日時 | 2024-07-21 01:29:54 |
合計ジャッジ時間 | 5,785 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 61 |
ソースコード
#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <iostream>#include <string>#include <cstdlib>#include <cmath>#include <vector>#include <unordered_map>#include <map>#include <set>#include <algorithm>#include <queue>#include <stack>#include <functional>#include <bitset>#include <assert.h>#include <unordered_map>#include <fstream>#include <ctime>#include <complex>using namespace std;typedef long long ll;typedef vector<ll> vl;typedef vector<vl> vvl;typedef vector<char> vc;typedef vector<string> vs;typedef vector<bool> vb;typedef vector<double> vd;typedef pair<ll,ll> P;typedef pair<int,int> pii;typedef vector<P> vpl;typedef tuple<ll,ll,ll> tapu;#define rep(i,n) for(int i=0; i<(n); i++)#define REP(i,a,b) for(int i=(a); i<(b); i++)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()const int inf = 1<<30;const ll linf = 1LL<<62;const int MAX = 1020000;ll dy[8] = {1,-1,0,0,1,-1,1,-1};ll dx[8] = {0,0,1,-1,1,-1,-1,1};const double pi = acos(-1);const double eps = 1e-10;template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b){a = b; return true;}else return false;}template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b){a = b; return true;}else return false;}template<typename T> inline void print(T &a){for(auto itr = a.begin(); itr != a.end(); itr++){cout << *itr << " ";}cout << "\n";}template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << "debug: " << a << " " << b << "\n";}template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){cout << "debug: " << a << " " << b << " " << c << "\n";}void mark() {cout << "#" << "\n";}ll pcount(ll x) {return __builtin_popcountll(x);}const int mod = 1e9 + 7;//const int mod = 998244353;template <std::uint_fast64_t Modulus> class modint {using u64 = std::uint_fast64_t;public:u64 a;constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}constexpr u64 &value() noexcept { return a; }constexpr const u64 &value() const noexcept { return a; }constexpr modint operator+(const modint rhs) const noexcept {return modint(*this) += rhs;}constexpr modint operator-(const modint rhs) const noexcept {return modint(*this) -= rhs;}constexpr modint operator*(const modint rhs) const noexcept {return modint(*this) *= rhs;}constexpr modint operator/(const modint rhs) const noexcept {return modint(*this) /= rhs;}constexpr modint &operator+=(const modint rhs) noexcept {a += rhs.a;if (a >= Modulus) {a -= Modulus;}return *this;}constexpr modint &operator-=(const modint rhs) noexcept {if (a < rhs.a) {a += Modulus;}a -= rhs.a;return *this;}constexpr modint &operator*=(const modint rhs) noexcept {a = a * rhs.a % Modulus;return *this;}constexpr modint &operator/=(modint rhs) noexcept {u64 exp = Modulus - 2;while (exp) {if (exp % 2) {*this *= rhs;}rhs *= rhs;exp /= 2;}return *this;}};using mint = modint<mod>;vector<ll> fac(MAX), finv(MAX), inv(MAX);void comInit(){fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for(ll i=2; i<MAX; i++){fac[i] = fac[i-1]*i % mod;inv[i] = mod - inv[mod%i] * (mod/i) % mod;finv[i] = finv[i-1] * inv[i] % mod;}}ll com(ll n, ll k){if(n < k) return 0;if(n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n-k] % mod) % mod;}ll modpow(ll x, ll n, ll mod){ll res = 1;while(n > 0){if(n & 1) res = res * x % mod;x = x * x % mod;n >>= 1;}return res;}int main(){ll n; cin >> n;ll q = sqrt(n) + 1;mint ans = 0;for(int i=2; i<=q; i++){ll tmp = n;while(tmp >= i){ans += tmp % i;tmp /= i;}ans += tmp;}ll now = q + 1;for(int i=q; i>=1; i--){if(now <= n/i){ll cnt = n/i - now + 1;ans += cnt * i;mint tmp = n;tmp *= cnt;mint tmp2 = now + now + cnt - 1;tmp2 *= cnt;tmp2 *= 500000004;tmp2 *= i;ans += tmp - tmp2;now = n/i + 1;}}cout << ans.value() << "\n";}