結果

問題 No.1581 Multiple Sequence
ユーザー soraie_soraie_
提出日時 2021-07-09 14:29:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 82 ms / 2,000 ms
コード長 5,799 bytes
コンパイル時間 5,453 ms
コンパイル使用メモリ 289,676 KB
実行使用メモリ 14,684 KB
最終ジャッジ日時 2023-09-14 06:28:28
合計ジャッジ時間 8,395 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
14,400 KB
testcase_01 AC 60 ms
14,408 KB
testcase_02 AC 82 ms
14,448 KB
testcase_03 AC 82 ms
14,368 KB
testcase_04 AC 64 ms
14,344 KB
testcase_05 AC 76 ms
14,636 KB
testcase_06 AC 67 ms
14,348 KB
testcase_07 AC 58 ms
14,412 KB
testcase_08 AC 63 ms
14,444 KB
testcase_09 AC 75 ms
14,504 KB
testcase_10 AC 69 ms
14,332 KB
testcase_11 AC 57 ms
14,328 KB
testcase_12 AC 62 ms
14,452 KB
testcase_13 AC 56 ms
14,516 KB
testcase_14 AC 73 ms
14,684 KB
testcase_15 AC 67 ms
14,120 KB
testcase_16 AC 56 ms
14,336 KB
testcase_17 AC 80 ms
14,516 KB
testcase_18 AC 54 ms
14,344 KB
testcase_19 AC 66 ms
14,436 KB
testcase_20 AC 69 ms
14,520 KB
testcase_21 AC 73 ms
14,504 KB
testcase_22 AC 63 ms
14,364 KB
testcase_23 AC 78 ms
14,416 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using namespace std;
//--------------------------------------------------------------------
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(ll _ThiS_WoNt_Be_usEd=0;_ThiS_WoNt_Be_usEd<(ll)n;++_ThiS_WoNt_Be_usEd)
#define rep2(i,n) for(ll i=0;i<(ll)n;++i)
#define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)
#define rep4(i,a,b,c) for(ll i=(ll)a;i<(ll)b;i+=(ll)c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#ifdef _DEBUG
#define pass(...) __VA_ARGS__ ;

#define debug1(a) cerr<<(#a)<<": "<<(a)<<"\n"
#define debug2(a,b) cerr<<(#a)<<": "<<(a)<<", "<<(#b)<<": "<<(b)<<"\n"
#define debug3(a,b,c) cerr<<(#a)<<": "<<(a)<<", "<<(#b)<<": "<<(b)<<", "<<(#c)<<": "<<(c)<<"\n"
#define debug4(a,b,c,d) cerr<<(#a)<<": "<<(a)<<", "<<(#b)<<": "<<(b)<<", "<<(#c)<<": "<<(c)<<", "<<(#d)<<": "<<(d)<<"\n"

/*
#define debug1(a) cout<<#a<<": "<<a<<"\n"
#define debug2(a,b) cout<<#a<<": "<<a<<", "<<#b<<": "<<b<<"\n"
#define debug3(a,b,c) cout<<#a<<": "<<a<<", "<<#b<<": "<<b<<", "<<#c<<": "<<c<<"\n"
#define debug4(a,b,c,d) cout<<#a<<": "<<a<<", "<<#b<<": "<<b<<", "<<#c<<": "<<c<<", "<<#d<<": "<<d<<"\n"
*/

#define debug(...) overload4(__VA_ARGS__,debug4,debug3,debug2,debug1)(__VA_ARGS__)
#define koko cerr << "koko\n";
#else
#define debug(...) void(0)
#define pass(...) void(0);
#define koko void(0);
#endif
#define mp make_pair
#define ten(d) int64_t(1e##d)
struct FASTIO{FASTIO(){ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}} fastio;
void doset(int n){cout << fixed << setprecision(n);cerr << fixed << setprecision(n);}
using ll = long long;
using ld = long double;
using dou = double;
template<class First,class Second>ostream& operator<<(ostream& os,const pair<First,Second>& pp)
{return os << "{" << pp.first << "," << pp.second << "}";}
template<class T>ostream& operator<<(ostream& os,const vector<T>& VV)
{if(VV.empty())return os<<"[]";os<<"[";rep(i,VV.size())os<<VV[i]<<(i==int(VV.size()-1)?"]":",");return os;}
template<class T>ostream& operator<<(ostream& os,const set<T>& SS)
{if(SS.empty())return os<<"[]";os<<"[";auto ii=SS.begin();for(;ii!=SS.end();ii++)os<<*ii<<(ii==prev(SS.end())?"]":",");return os;}
template<class Key,class Tp>ostream& operator<<(ostream& os,const map<Key,Tp>& MM)
{if(MM.empty())return os<<"[]";os<<"[";auto ii=MM.begin();for(;ii!=MM.end();ii++)os<<"{"<<ii->first<<":"<<ii->second<<"}"<<(ii==prev(MM.end())?"]":",");return os;}
constexpr int inf = 1 << 30;
constexpr ll INF = 1LL << 61;
constexpr ld pi = 3.14159265358;
constexpr ll mod1 = 1000000007LL;
constexpr ll mod2 = 998244353LL;
using pll = pair<ll,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
template<class T, class U> inline bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T, class U> inline bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }
ll modpow(ll n,ll m,ll MOD){
    if(m == 0)return 1;
    if(m < 0)return 0;
    ll res = 1;
    n %= MOD;
    while(m){
        if(m & 1)res = (res * n) % MOD;
        m >>= 1;
        n *= n;
        n %= MOD;
    }
    return res;
}
ll mypow(ll n,ll m){
    if(m == 0)return 1;
    if(m < 0)return -1;
    ll res = 1;
    while(m){
        if(m & 1)res = (res * n);
        m >>= 1;
        n *= n;
    }
    return res;
}

inline bool isp(ll n){
    bool res = true;
    if(n == 1 || n == 0)return false;
    else{
        for(ll i = 2;i * i <= n;i++){
            if(n % i == 0){
                res = false;
                break;
            }
        }
        return res;
    }
}
inline bool Yes(bool b = 1){cout << (b ? "Yes\n":"No\n");return b;}
inline bool YES(bool b = 1){cout << (b ? "YES\n":"NO\n");return b;}
map<ll,ll> primefactor(ll n){
    map<ll,ll> ma;
    if(n <= 1)return ma;
    ll m = n;
    for(ll i = 2;i * i <= n;i++){
        while(m % i == 0){
            ma[i]++;
            m /= i;
        }
    }
    if(m != 1)ma[m]++;
    return ma;
}
vector<ll> divisor(ll n,bool sorted = true,bool samein = false){
    vector<ll> res;
    for(ll i = 1;i * i <= n;i++){
        if(n % i == 0){
            res.push_back(i);
            if(i * i != n || samein)res.push_back(n / i);
        }
    }
    if(sorted)sort(all(res));
    return res;
}

ll __lcm(ll a,ll b){return a / __gcd(a,b) * b;}

template<class T>T sum(const vector<T> &V){T r=0;for(auto x:V)r+=x;return r;}
template<class T>T sum(const initializer_list<T> &V){T r=0;for(auto x:V)r+=x;return r;}

#if __has_include("atcoder/all")
#include <atcoder/all>
using namespace atcoder;
template<int m>ostream& operator<<(ostream& os,const static_modint<m>& self){return os << self.val();}
template<int id>ostream& operator<<(ostream& os,const dynamic_modint<id>& self){return os << self.val();}
#endif

// #if __has_include("boost/multiprecision/cpp_dec_float.hpp")
// #include <boost/multiprecision/cpp_dec_float.hpp>
// using lld = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;
// #endif

// #if __has_include("boost/multiprecision/cpp_int.hpp")
// #include <boost/multiprecision/cpp_int.hpp>
// using lll = boost::multiprecision::cpp_int;
// #endif

//--------------------------------------------------------------------

vector<ll> memo(100010);
vector<vector<int>> ds(100010);
void pre(){
    rep(i,1,100010){
        rep(j,i,100010,i)ds[j].push_back(i);
    }
}

int main(){
    int N;
    cin >> N;
    pre();
    rep(i,N + 1){
        if(i == 0)memo[i] = 1;
        else{
            for(auto x : ds[i])memo[i] = (memo[i] + memo[(i - x) / x]) % mod1;
        }
    }
    cout << memo[N] << "\n";
}
0