結果

問題 No.1532 Different Products
ユーザー kiyoshi0205kiyoshi0205
提出日時 2021-06-04 22:11:50
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 869 ms / 4,000 ms
コード長 4,598 bytes
コンパイル時間 2,501 ms
コンパイル使用メモリ 186,524 KB
実行使用メモリ 299,008 KB
最終ジャッジ日時 2024-04-30 03:08:58
合計ジャッジ時間 31,221 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 93 ms
48,768 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 4 ms
5,376 KB
testcase_09 AC 31 ms
23,040 KB
testcase_10 AC 116 ms
63,360 KB
testcase_11 AC 85 ms
50,944 KB
testcase_12 AC 323 ms
144,896 KB
testcase_13 AC 164 ms
95,872 KB
testcase_14 AC 674 ms
246,528 KB
testcase_15 AC 18 ms
13,696 KB
testcase_16 AC 138 ms
57,216 KB
testcase_17 AC 95 ms
58,368 KB
testcase_18 AC 70 ms
48,768 KB
testcase_19 AC 299 ms
137,856 KB
testcase_20 AC 670 ms
248,192 KB
testcase_21 AC 211 ms
81,920 KB
testcase_22 AC 173 ms
92,672 KB
testcase_23 AC 96 ms
63,616 KB
testcase_24 AC 599 ms
228,480 KB
testcase_25 AC 297 ms
126,080 KB
testcase_26 AC 28 ms
19,072 KB
testcase_27 AC 296 ms
110,336 KB
testcase_28 AC 198 ms
85,248 KB
testcase_29 AC 186 ms
68,480 KB
testcase_30 AC 411 ms
147,584 KB
testcase_31 AC 407 ms
150,272 KB
testcase_32 AC 482 ms
174,336 KB
testcase_33 AC 373 ms
134,784 KB
testcase_34 AC 586 ms
214,912 KB
testcase_35 AC 504 ms
173,184 KB
testcase_36 AC 604 ms
210,048 KB
testcase_37 AC 90 ms
36,992 KB
testcase_38 AC 615 ms
223,872 KB
testcase_39 AC 566 ms
199,296 KB
testcase_40 AC 545 ms
203,520 KB
testcase_41 AC 806 ms
290,304 KB
testcase_42 AC 713 ms
257,664 KB
testcase_43 AC 745 ms
269,568 KB
testcase_44 AC 804 ms
294,784 KB
testcase_45 AC 793 ms
295,520 KB
testcase_46 AC 770 ms
286,592 KB
testcase_47 AC 820 ms
298,596 KB
testcase_48 AC 825 ms
295,168 KB
testcase_49 AC 869 ms
296,676 KB
testcase_50 AC 811 ms
294,752 KB
testcase_51 AC 814 ms
297,568 KB
testcase_52 AC 797 ms
291,968 KB
testcase_53 AC 825 ms
298,844 KB
testcase_54 AC 794 ms
292,224 KB
testcase_55 AC 808 ms
296,192 KB
testcase_56 AC 784 ms
286,464 KB
testcase_57 AC 778 ms
288,640 KB
testcase_58 AC 830 ms
293,728 KB
testcase_59 AC 766 ms
277,376 KB
testcase_60 AC 803 ms
299,008 KB
testcase_61 AC 2 ms
5,376 KB
testcase_62 AC 2 ms
5,376 KB
testcase_63 AC 801 ms
296,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<long double,long double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define popcount __builtin_popcountll
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
// constexpr ll mod=1000000007;
constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr long double eps=1e-9;
const long double PI=acosl(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

inline void startupcpp(void) noexcept{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

ll modinv(ll a,const ll m=mod) noexcept{
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(const ll a,const ll b) noexcept{return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(const ll n,const ll r) noexcept{
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod;
    modncrlistm[n]=modinv(modncrlistp[n]);
    for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod;
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,const ll m=mod){
  if(n<0)return 0;
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

constexpr ll gcd(const ll a,const ll b) noexcept{return (!b)?abs(a):(a%b==0)?abs(b):gcd(b,a%b);}
constexpr ll lcm(const ll a,const ll b) noexcept{return a/gcd(a,b)*b;}



ll K,K2,val[200001],memo[201][200001];
int N;
int valsize;
int ind(ll x){return x<=K2?valsize-int(x):int(double(K)/x)-1;}
ll calc(int now,ll x){
  int i=ind(x);
  if(memo[now][i])return memo[now][i];
  if(now>x)return memo[now][i]=1;
  if(now==x||now==N)return memo[now][i]=2;
  return memo[now][i]=calc(now+1,x)+calc(now+1,ll(double(x)/now));
}
int main(){
  startupcpp();
  cin>>N>>K;
  K2=sqrtl(K);
  for(ll now=K;now;now=K/(K/now+1)){
    val[valsize]=now;
    valsize++;
  }
  print(calc(1,K)-1);
}
0