結果
問題 | No.1035 Color Box |
ユーザー |
![]() |
提出日時 | 2020-04-24 22:38:54 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 2,739 bytes |
コンパイル時間 | 630 ms |
コンパイル使用メモリ | 118,616 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-22 06:45:00 |
合計ジャッジ時間 | 1,936 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
import std.stdio, std.conv, std.functional, std.string;import std.algorithm, std.array, std.container, std.range, std.typecons;import std.bigint, std.numeric, std.math, std.random;import core.bitop;string FMT_F = "%.10f";static File _f;void file_io(string fn) { _f = File(fn, "r"); }static string[] s_rd;T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); }size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }bool inside(T)(T x, T b, T e) { return x >= b && x < e; }T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }long mod = 10^^9 + 7;//long mod = 998_244_353;//long mod = 1_000_003;void moda(T)(ref T x, T y) { x = (x + y) % mod; }void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }void modm(T)(ref T x, T y) { x = (x * y) % mod; }void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); }struct Cmb{void init(long n){long powmod(long a, long p){long ans = 1;long mul = a;while (p > 0){if ((p & 1) == 1)ans.modm(mul);p >>= 1;mul.modm(mul);}return ans;}++n;fact = new long[2][](n);fact[0][0] = 1;foreach (i; 1..n){fact[i][0] = fact[i-1][0];fact[i][0].modm(i);}fact[n-1][1] = powmod(fact[n-1][0], mod - 2);foreach_reverse (i; 0..n-1){fact[i][1] = fact[i+1][1];fact[i][1].modm(i+1);}}long get(long n, long r){long res = fact[n][0];res.modm(fact[r][1]);res.modm(fact[n-r][1]);return res;}long[2][] fact;}void main(){auto N = RD;auto M = RD;Cmb cmb;cmb.init(M);long ans;foreach (i; 1..M+1){long pat = i;pat.modpow(N);pat.modm(cmb.get(M, i));pat.mods(ans);ans = pat;//debug writeln(ans);}writeln(ans);stdout.flush;debug readln;}