# Submit Info #14437

Problem Lang User Status Time Memory
Montmort Number cpp Hyado AC 81 ms 17.77 MiB

ケース詳細
Name Status Time Memory
example_00 AC 1 ms 0.71 MiB
example_01 AC 2 ms 0.68 MiB
max_00 AC 81 ms 17.30 MiB
max_01 AC 76 ms 17.50 MiB
max_02 AC 67 ms 17.77 MiB
random_00 AC 33 ms 7.11 MiB
random_01 AC 34 ms 8.17 MiB
random_02 AC 47 ms 10.52 MiB
random_03 AC 33 ms 8.00 MiB
random_04 AC 63 ms 14.30 MiB

//#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using db = double; using ld = long double; template<typename T> using V = vector<T>; template<typename T> using VV = vector<vector<T>>; #define fs first #define sc second #define pb push_back #define mp make_pair #define mt make_tuple #define eb emplace_back #define lb lower_bound #define ub upper_bound #define all(v) (v).begin(),(v).end() #define siz(v) (ll)(v).size() #define rep(i,a,n) for(ll i=a;i<(ll)(n);++i) #define repr(i,a,n) for(ll i=n-1;(ll)a<=i;--i) #define ENDL '\n' typedef pair<int,int> Pi; typedef pair<ll,ll> PL; constexpr ll mod = 1000000007; constexpr ll INF = 1000000099; constexpr ll LINF = (ll)(1e18 +99); const vector<ll> dx={-1,1,0,0},dy={0,0,-1,1}; template<typename T,typename U> inline bool chmin(T& t, const U& u){if(t>u){t=u;return 1;}return 0;} template<typename T,typename U> inline bool chmax(T& t, const U& u){if(t<u){t=u;return 1;}return 0;} template<typename T> inline T gcd(T a,T b){return b?gcd(b,a%b):a;} template<typename T,typename Y> inline T mpow(T a, Y n) { T res = 1; for(;n;n>>=1) { if (n & 1) res = res * a; a = a * a; } return res; } template<typename T,typename Y> ostream& operator<<(ostream& os,const pair<T,Y>& p){ return os<<"{"<<p.fs<<","<<p.sc<<"}"; } template<typename T> ostream& operator<<(ostream& os,const V<T>& v){ os<<"{"; for(auto e:v)os<<e<<","; return os<<"}"; } template<typename ...Args> void debug(Args&... args){ for(auto const& x:{args...}){ cerr<<x<<' '; } cerr<<ENDL; } signed main(){ cin.tie(0);cerr.tie(0);ios::sync_with_stdio(false); cout<<fixed<<setprecision(20); ll n,m;cin>>n>>m; V<ll> ans(n); ans[1]=0; ans[2]=1; rep(i,1,n+1){ if(i>2)ans[i]=((i-1)*(ans[i-1]+ans[i-2]))%m; cout<<ans[i]<<" "; } cout<<ENDL; } //! ( . _ . ) ! //CHECK overflow,vector_size,what to output?