結果
問題 | No.1731 Product of Subsequence |
ユーザー |
![]() |
提出日時 | 2021-07-29 20:53:16 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 535 ms / 2,000 ms |
コード長 | 2,902 bytes |
コンパイル時間 | 2,178 ms |
コンパイル使用メモリ | 205,616 KB |
最終ジャッジ日時 | 2025-01-23 10:12:02 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 31 |
ソースコード
#define _USE_MATH_DEFINES#include <bits/stdc++.h>using namespace std;//template#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)#define ALL(v) (v).begin(),(v).end()using ll=long long int;const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}template<int mod=1000000007>struct fp {int v; static int get_mod(){return mod;}int inv() const{int tmp,a=v,b=mod,x=1,y=0;while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y);if(x<0){x+=mod;} return x;}fp(ll x=0){init(x%mod+mod);}fp& init(int x){v=(x<mod?x:x-mod); return *this;}fp operator-()const{return fp()-*this;}fp pow(ll t){fp res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;} return res;}fp& operator+=(const fp& x){return init(v+x.v);}fp& operator-=(const fp& x){return init(v+mod-x.v);}fp& operator*=(const fp& x){v=ll(v)*x.v%mod; return *this;}fp& operator/=(const fp& x){v=ll(v)*x.inv()%mod; return *this;}fp operator+(const fp& x)const{return fp(*this)+=x;}fp operator-(const fp& x)const{return fp(*this)-=x;}fp operator*(const fp& x)const{return fp(*this)*=x;}fp operator/(const fp& x)const{return fp(*this)/=x;}bool operator==(const fp& x)const{return v==x.v;}bool operator!=(const fp& x)const{return v!=x.v;}friend istream& operator>>(istream& is,fp& x){ll t; is>>t; x=init(t); return is;}friend ostream& operator<<(ostream& os,const fp& x){os<<x.v; return os;}}; using Fp=fp<>;template<typename T>struct factorial {vector<T> Fact,Finv,Inv;factorial(int maxx){Fact.resize(maxx); Finv.resize(maxx); Inv.resize(maxx);Fact[0]=Fact[1]=Finv[0]=Finv[1]=Inv[1]=1;rep(i,2,maxx){Fact[i]=Fact[i-1]*i;} Finv[maxx-1]=Fact[maxx-1].inv();for(int i=maxx-1;i>=2;i--){Finv[i-1]=Finv[i]*i; Inv[i]=Finv[i]*Fact[i-1];}}T fact(int n,bool inv=0){if(n<0)return 0; return (inv?Finv[n]:Fact[n]);}T inv(int n){if(n<0)return 0; return Inv[n];}T nPr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return fact(n,inv)*fact(n-r,inv^1);}T nCr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return fact(n,inv)*fact(r,inv^1)*fact(n-r,inv^1);}T nHr(int n,int r,bool inv=0){return nCr(n+r-1,r,inv);}};map<int,Fp> from,to;int main(){int n,k;cin>>n>>k;assert(1<=n and n<=2000);assert(1<=k and k<=1000000000);vector<ll> a(n);rep(i,0,n){cin>>a[i];assert(1<=a[i] and a[i]<=1000000000000000000LL);}rep(i,0,n)a[i]=gcd(a[i],k);from[1]=1;rep(i,0,n){to.clear();for(auto& [x,v]:from){to[x]+=v;to[gcd(x*a[i],k)]+=v;}swap(from,to);}Fp res=from[k];if(k==1)res-=1;cout<<res<<'\n';return 0;}