結果
問題 | No.129 お年玉(2) |
ユーザー |
|
提出日時 | 2022-12-13 16:24:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
MLE
|
実行時間 | - |
コード長 | 2,800 bytes |
コンパイル時間 | 2,295 ms |
コンパイル使用メモリ | 205,440 KB |
最終ジャッジ日時 | 2025-02-09 11:00:00 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 29 MLE * 17 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define all(x) (x).begin(), (x).end()#define sz(x) int(x.size())#define yn(joken) cout<<((joken) ? "Yes" : "No")<<"\n"#define YN(joken) cout<<((joken) ? "YES" : "NO")<<"\n"using namespace std;using ll = long long;using vi = vector<int>;using vl = vector<ll>;using vs = vector<string>;using vc = vector<char>;using vd = vector<double>;using vld = vector<long double>;using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvc = vector<vector<char>>;using vvd = vector<vector<double>>;using vvld = vector<vector<long double>>;using vvvi = vector<vector<vector<int>>>;using vvvl = vector<vector<vector<ll>>>;using vvvvi = vector<vector<vector<vector<int>>>>;using vvvvl = vector<vector<vector<vector<ll>>>>;using pii = pair<int,int>;using pll = pair<ll,ll>;const int INF = 1e9;const ll LINF = 2e18;template <class T>bool chmax(T& a, const T& b) {if (a < b) {a = b;return 1;}return 0;}template <class T>bool chmin(T& a, const T& b) {if (b < a) {a = b;return 1;}return 0;}bool ispow2(int i) { return i && (i & -i) == i; }bool ispow2(ll i) { return i && (i & -i) == i; }template <class T>vector<T> make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>auto make_vec(size_t a, Ts... ts) {return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));}template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (int i = 0; i < int(v.size()); i++) {is >> v[i];}return is;}template <typename T>ostream& operator<<(ostream& os, const vector<T>& v) {for (int i = 0; i < int(v.size()); i++) {os << v[i];if (i < int(v.size()) - 1) os << ' ';}return os;}static uint32_t RandXor(){static uint32_t x=123456789;static uint32_t y=362436069;static uint32_t z=521288629;static uint32_t w=88675123;uint32_t t;t=x^(x<<11);x=y; y=z; z=w;return w=(w^(w>>19))^(t^(t>>8));}static double Rand01(){return (RandXor()+0.5)*(1.0/UINT_MAX);}void solve(){ll N,M;cin>>N>>M;N/=1000;N%=M;vvl P(M+1,vl(M+1));P[0][0]=1;for(int i=1;i<=M;i++){for(int j=0;j<=i;j++){P[i][j]+=P[i-1][j];if(j) P[i][j]+=P[i-1][j-1];if(P[i][j]>INF) P[i][j]-=INF;}}cout<<P[M][N]<<"\n";}int main(){cin.tie(nullptr);ios::sync_with_stdio(false);solve();}