結果
問題 | No.2120 場合の数の下8桁 |
ユーザー | FF256grhy |
提出日時 | 2022-11-04 22:08:44 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,380 ms / 2,000 ms |
コード長 | 6,520 bytes |
コンパイル時間 | 2,086 ms |
コンパイル使用メモリ | 205,080 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-18 19:57:21 |
合計ジャッジ時間 | 6,215 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define incII(i, l, r) for(decay_t<decltype(r)> i = (l) ; i <= (r); i++)#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l) ; i < (r); i++)#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i < (r); i++)#define decII(i, l, r) for(decay_t<decltype(r)> i = (r) ; i >= (l); i--)#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r) ; i > (l); i--)#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i > (l); i--)#define inc(i, n) incIX(i, 0, n)#define dec(i, n) decIX(i, 0, n)#define inc1(i, n) incII(i, 1, n)#define dec1(i, n) decII(i, 1, n)auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a < r); };auto inXI = [](auto a, auto l, auto r) -> bool { return (l < a && a <= r); };auto inXX = [](auto a, auto l, auto r) -> bool { return (l < a && a < r); };auto setmin = [](auto & a, auto b) -> bool { return (b < a ? a = b, true : false); };auto setmax = [](auto & a, auto b) -> bool { return (b > a ? a = b, true : false); };auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };using LL = long long int;using LD = long double;#define PB push_back#define EB emplace_back#define MP make_pair#define MT make_tuple#define FI first#define SE second#define FR front()#define BA back()#define ALL(a) begin(a), end(a)#define RALL(a) rbegin(a), rend(a)#define RV(a) reverse(ALL(a))#define ST(a) sort(ALL(a))#define RST(a) sort(RALL(a))#define SC static_cast#define SI(a) SC<int>(a.size())#define SL(a) SC<LL>(a.size())#define RF(e, ...) for(auto && e: __VA_ARGS__)#define SF(a, ...) for(auto && [__VA_ARGS__]: a)#define until(...) while(not(__VA_ARGS__))#define if_not(...) if(not(__VA_ARGS__))#define ef else if#define UR assert(false)auto * IS = & cin;auto * OS = & cout;template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }#define IN(...) __VA_ARGS__; in(__VA_ARGS__)struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;void out_([[maybe_unused]] string const & s) { }template<typename A > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }template<typename A, typename ... B> void out_( string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }auto outF = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; };auto outN = [](auto const & ... a) { outF("" , "" , a ...); };auto outS = [](auto const & ... a) { outF(" " , " " , a ...); };auto outL = [](auto const & ... a) { outF("\n", "\n", a ...); };auto outSN = [](auto const & ... a) { outF(" " , "" , a ...); };auto outNL = [](auto const & ... a) { outF("" , "\n", a ...); };auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); };auto out = outSL;template<typename A > void disp_(A const & a) { * OS << a; }template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s;disp_(e, t ...); } }auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };auto dispL = [](auto const & a, auto const & ... t) { dispT(a, "\n", t ...); };template<typename A> istream & operator>>(istream & is, vector<A> & v) { for(auto && e: v) { is >> e; } return is; }template<typename A> ostream & operator<<(ostream & os, vector<A> const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; }template<typename A > auto make_v(A a) { return a; }template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }template<typename A, size_t N> istream & operator>>(istream & is, array<A, N> & a) { for(auto && e: a) { is >> e; } return is; }template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; }return os; }template<typename A, typename B> istream & operator>>(istream & is, pair<A, B> & p) { return is >> p.first >> p.second; }template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p) { return os << p.first << " " << p.second; }template<int I = 0, typename T> void tin_ (istream & is, T & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t);} }template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }template<typename ... A> istream & operator>>(istream & is, tuple<A ...> & t) { tin_ (is, t); return is; }template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }// ---- ----auto mo = [](auto a, auto b) { assert(b != 0); a %= b; if(a < 0) { a += abs(b); } return a; };const int M = 100000000;struct C {LL v = 1, e2 = 0, e5 = 0;void mul(LL x) {while(x % 2 == 0) { e2++; x /= 2; }while(x % 5 == 0) { e5++; x /= 5; }v *= x;v %= M;}void div(LL x) {while(x % 2 == 0) { e2--; x /= 2; }while(x % 5 == 0) { e5--; x /= 5; }v *= inv(x);v %= M;}LL val() {assert(e2 >= 0 && e5 >= 0);LL ans = v;inc(i, e2) { (ans *= 2) %= M; }inc(i, e5) { (ans *= 5) %= M; }return ans;}LL inv(LL x) {return mo(ext_gcd(M, x).SE, M);}pair<LL, LL> ext_gcd(LL a, LL b) {if(b == 0) { assert(a == 1); return { 1, 0 }; }auto p = ext_gcd(b, a % b);return { p.SE, p.FI - (a / b) * p.SE };}};int main() {int IN(m, n);if(n > m) { out(string(8, '0')); exit(0); }n = min(n, m - n);C c;inc(i, n) {c.mul(m - i);c.div(i + 1);}string ans = to_string(c.val());out(string(8 - SI(ans), '0') + ans);}