結果
問題 | No.2120 場合の数の下8桁 |
ユーザー | 👑 AngrySadEight |
提出日時 | 2022-11-04 22:25:52 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,928 ms / 2,000 ms |
コード長 | 4,015 bytes |
コンパイル時間 | 4,408 ms |
コンパイル使用メモリ | 264,592 KB |
実行使用メモリ | 159,592 KB |
最終ジャッジ日時 | 2024-07-18 20:21:06 |
合計ジャッジ時間 | 16,342 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 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 | 1,928 ms
159,576 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 11 ms
5,376 KB |
testcase_10 | AC | 883 ms
80,000 KB |
testcase_11 | AC | 1,909 ms
159,568 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 11 ms
5,376 KB |
testcase_14 | AC | 28 ms
6,528 KB |
testcase_15 | AC | 854 ms
78,788 KB |
testcase_16 | AC | 1,813 ms
151,652 KB |
testcase_17 | AC | 1,844 ms
156,672 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 1,882 ms
159,592 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int,int>> #define vpll vector<pair<ll,ll>> #define vvpii vector<vector<pair<int,int>>> #define vvpll vector<vector<pair<ll,ll>>> template<typename T> void debug(T e){ cerr << e << endl; } template<typename T> void debug(vector<T> &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template<typename T> void debug(vector<vector<T>> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template<typename T> void debug(vector<pair<T, T>> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template<typename T> void debug(set<T> &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(multiset<T> &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(map<T, T> &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } ll my_pow(ll x, ll n, ll mod){ // 繰り返し二乗法.x^nをmodで割った余り. ll ret; if (n == 0){ ret = 1; } else if (n % 2 == 1){ ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod; } else{ ret = my_pow((x * x) % mod, n / 2, mod); } return ret; } int main(){ ll M, N; cin >> M; cin >> N; if (M < N){ cout << "00000000" << endl; return 0; } ll mod = 100000000; vector<ll> prime(M + 2, -1); for (ll i = 2; i <= M + 1; i++){ if (prime[i] == -1){ for (ll j = 2; j * i <= M + 1; j++){ prime[j * i] = i; } } } //debug(prime); vector<ll> counter(M + 1, 0); for (ll i = 2; i <= M; i++){ ll now = i; while(true){ if (prime[now] == -1){ counter[now]++; break; } else{ counter[prime[now]]++; now /= prime[now]; } } } for (ll i = 2; i <= N; i++){ ll now = i; while(true){ if (prime[now] == -1){ counter[now]--; break; } else{ counter[prime[now]]--; now /= prime[now]; } } } for (ll i = 2; i <= (M - N); i++){ ll now = i; while(true){ if (prime[now] == -1){ counter[now]--; break; } else{ counter[prime[now]]--; now /= prime[now]; } } } ll ans = 1; for (ll i = 2; i <= M; i++){ if (counter[i] != 0){ ans = (ans * my_pow(i, counter[i], mod)) % mod; } } string sans = to_string(ans); for (ll i = 0; i < 8 - sans.size(); i++) cout << '0'; cout << ans << endl; }