Quick Notes
激励
每当在书中读及那些卑微的努力,都觉得感动且受震撼。也许每个人在发出属于自己的光芒之前,都经历了无数的煎熬,漫长的黑夜,无尽的孤独,甚至不断的嘲讽和否定,但好在那些踮脚的少年,最后都得到了自己想要的一切。
link
https://me.csdn.net/sz_165394732
https://www.luogu.org/discuss/show/82076
compare
int jc[mod], ijc[mod];
inline int qpow(int x, int y) {
int r=1;
for (; y; y>>=1, x=x*x%mod) if (y&1) r=r*x%mod;
return r;
}
inline void init() {
jc[0]=1; for (int i=1; i<mod; ++i) jc[i]=jc[i-1]*i%mod;
ijc[mod-1]=qpow(jc[mod-1], mod-2);
for (int i=mod-2; i>=0; --i) ijc[i]=ijc[i+1]*(i+1)%mod;
}
inline int C(int x, int y) {return jc[x]*(ijc[x-y]*ijc[y]%mod)%mod; }
inline int lucas(int x, int y) {
if (y>x) return 0;
int r=1;
for (; y; x/=mod, y/=mod) r=r*C(x%mod, y%mod);
return r;
}
int T, n, m;
int main() {
init();
scanf("%d", &T);
while (T--) {
scanf("%d%d", &n, &m);
printf("%d\n", lucas(n, m));
}
return 0;
}
int jc[mod], inv[mod], t, n, m;
inline int lucas(int a, int b) {
if (a > b) return 0;
if (b <= mod) return jc[b] * inv[a] % mod * inv[b - a] % mod;
return lucas(a / mod, b / mod) * lucas(a % mod, b % mod) % mod;
}
int main(void) {
jc[0] = jc[1] = inv[0] = inv[1] = 1;
for (int i = 2; i < mod; ++i) jc[i] = jc[i - 1] * i % mod, inv[i] = (mod - mod / i) * inv[mod % i] % mod;
for (int i = 2; i < mod; ++i) inv[i] = inv[i - 1] * inv[i] % mod;
for (scanf("%d", &t); t; --t) scanf("%d%d", &n, &m), printf("%d\n", lucas(m, n));
return 0;
}
ぼくのフレンド (Boku no Friend)
aienkien ichigoichie
sode suriau mo tashou no en
kono yo no kiseki gyutto tsumete
kimi to deaetanda
aoi haru itsuka maku o toji
sakura to tomo ni maichittemo
kanarazu bokura mata dokoka de
deai o hatasu darou
kakegae nai
boku to nita kimi e
hitori de koronde kizu darake ni natta toki wa
itsudemo dokomademo hashiru yo
tama ni wa kenka shite okorou
nakigao mitara nagusameyou
tobikiri no nagai o sekkyou wa mijikame ni shite
kirei na mono o sagashi ni yukou
oishii mono mo takusan tabeyou
tsumari wa korekara mo douka yoroshiku ne
toki ga tatsu no wa hayai mono de
wakare no kisetsu ga kao o dasu
tsumiagetekita mono ga yake ni
namida o sasounda
aoi haru ga ima maku o toji
sakura ga chiru oto wa shizuka de
setsunai omoi ga oshiyoseta
sayonara no yuuyake
kakegae nai
boku to nita kimi wa
hitori demo daijoubu dakara tada mae o mite
hirogaru michi o hashirunda
tama ni wa futari katariaou
iya na koto zenbu hakidasou
tobikiri no nagai adobaisu wa chanto kiitete
ureshii koto wa houkoku shiyou
atarashii deai daiji ni shiyou
tsumari wa itsudemo itsumademo?
aa bokura wa tatta ima
gooru wa betsubetsu sutaato rain
omoide shimaikonde
fumidashita saki wa mirai e
kakegae nai
boku to nita kimi wa
hitori demo daijoubu dakara tada mae o mite
hirogaru michi o hashirunda
tama ni wa hodohodo ni yasumou
yasumetara yururi to susumou
tobikiri nagai kinkyou houkoku omachi shitemasu
doredake teki o tsukurou tomo
boku ga kimi no mikata de iru kara
tsumari wa korekara mo douka yoroshiku ne
最新文章
- [ios] 定位报错Error Domain=kCLErrorDomain Code=0 ";The operation couldn’t be completed. (kCLErrorDomain error 0.)";
- Python之路,Day7 - 面向对象编程进阶
- mysql替换制定的内容的 类似正则表达式的功能
- centos 服务开机启动设置
- php数据库封装与引用方法
- 解决dropdownlist postback 在 iphone UIwebview 失效的问题
- Linux定义系统提示符的变量:PS1
- 改ucosii的中断禁止和恢复代码,这是一个荒谬的错误【 mrs msr】
- 【Beta阶段】第六次scrum meeting
- 补写:Best Coder #85 1001 Sum(前缀和)
- 【maven教程】(1)---maven环境配置
- Charles 抓包工具使用部分问题总结
- mysql 数据表字段修改sql 语句
- python每日学习2018/1/11
- 关于java中,json字符串转集合和对象,或者集合转json字符串的解决方法
- Vue 学习笔记 — filter
- 弹窗滑动,造成body跟随滑动解决办法
- 2019元月新SAP项目落地记
- 【HANA系列】SAP HANA XS使用服务器JavaScript Libraries详解
- Python实现网页截图(PyQT5)
热门文章
- vmware14克隆后UUID相同的解决方法
- Spring学习02——控制反转、依赖注入
- myeclipse 2015 myeclipse2010破解共存
- Python学习笔记(20)-文件和文件夹的移动、复制、删除、重命名
- github javascript相关项目star数排行榜(前30,截止2016.11.18):
- HDU-1394 Minimum Inversion Number (逆序数,线段树或树状数组)
- HDU-1847 Good Luck in CET-4 Everybody! (博弈+找规律)
- python 安装opencv及问题解决
- 数据写入到Excel,模板样式复杂
- 网络安全专家教你设置史上最安全的WiFi密码