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
Quick Notes的更多相关文章
- Git Commands Quick Notes
Fetch This command is to make sure your local repository has the same knowledge of the remote-tracki ...
- 如何调试IIS错误信息
原文链接: http://blogs.msdn.com/b/tess/archive/2009/03/20/debugging-a-net-crash-with-rules-in-debug-diag ...
- the security of smart contract- 1
https://blog.zeppelin.solutions/the-hitchhikers-guide-to-smart-contracts-in-ethereum-848f08001f05 这个 ...
- MongoDB add sharding -- Just a note
1. Configure Configuration Server. 1.1. Create a directory: e.g. C:\data\dbs\config 1.2. Start confi ...
- 如何利用Emacs进行个人时间管理(GTD)
1. 简介 1.1 什么是GTD Get Things Done(GTD),是一套时间管理方法,面对生活中如下情况: 有很多事情要做 每件事情有主次之分 个人精力有限 我们需要随时很方便的了解我们下一 ...
- MapServer教程3
Compiling on Unix Compiling on Win32 PHP MapScript Installation .NET MapScript Compilation IIS Setup ...
- Git for Windows v2.11.0 Release Notes
homepage faq contribute bugs questions Git for Windows v2.11.0 Release Notes Latest update: December ...
- Canu Quick Start(快速使用Canu)
Canu Quick Start Canu Quick Start PBcR (老版的canu) CA Canu specializes in(专门从事) assembling PacBio or O ...
- (转) Quick Guide to Build a Recommendation Engine in Python
本文转自:http://www.analyticsvidhya.com/blog/2016/06/quick-guide-build-recommendation-engine-python/ Int ...
随机推荐
- hive重要命令
hadoop dfsadmin -safemode leave hadoop退出安全模式让提示符显示当前库: set hive.cli.print.current.db=true;显示查询结果时显示字 ...
- Python笔记(二十五)_魔法方法_描述符
描述符的属性方法 __get__(self, instance, owner): 用于访问属性,返回属性的值 __set__(self, instance, value): 用于给属性赋值时,返回属性 ...
- bzoj-2525 Dynamite
Byteotian Cave的结构是一棵N个节点的树,其中某些点上面已经安置了烟火,现在需要点燃M个点上的引线引爆所有的烟火.某个点上的引线被点燃后的1单位时间内,在树上和它相邻的点的引线会被点燃.如 ...
- Ecshop二次开发必备基础
EcShop二次开发学习方法 近年来,随着互联网的发展,电子商务也跟着一起成长,B2B,C2C,B2C的电子商务模式也不断的成熟.这时催生出了众多电子商务相关的PHP开源产品.B2C方面有Ecshop ...
- 一些基础的ES6 语法
<script> window.onload = function () { //---------------------------let----------------------- ...
- CDH平台搭建遇到的问题
安装之前遇到的问题: Note: Forwarding request to 'systemctl disable NetworkManager.service'. Removed symlink ...
- 【Python—字典的用法】创建字典的3种方法
#创建一个空字典 empty_dict = dict() print(empty_dict) #用**kwargs可变参数传入关键字创建字典 a = dict(one=1,two=2,three=3) ...
- Java-第N篇推荐的一些学习书籍
1.推荐的一些学习书籍或者需要掌握的基本知识 book | |---ant | |---maven | |---git(菜鸟教程) | |---Dos shell | |---linux常用的命令.l ...
- Codeforces 609E (Kruskal求最小生成树+树上倍增求LCA)
题面 传送门 题目大意: 给定一个无向连通带权图G,对于每条边(u,v,w)" role="presentation" style="position: rel ...
- ListView鼠标拖
private Point Position = new Point(0, 0); private void treeFileView_ItemDrag(object sender, ItemDrag ...