激励

每当在书中读及那些卑微的努力,都觉得感动且受震撼。也许每个人在发出属于自己的光芒之前,都经历了无数的煎熬,漫长的黑夜,无尽的孤独,甚至不断的嘲讽和否定,但好在那些踮脚的少年,最后都得到了自己想要的一切。

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的更多相关文章

  1. Git Commands Quick Notes

    Fetch This command is to make sure your local repository has the same knowledge of the remote-tracki ...

  2. 如何调试IIS错误信息

    原文链接: http://blogs.msdn.com/b/tess/archive/2009/03/20/debugging-a-net-crash-with-rules-in-debug-diag ...

  3. the security of smart contract- 1

    https://blog.zeppelin.solutions/the-hitchhikers-guide-to-smart-contracts-in-ethereum-848f08001f05 这个 ...

  4. 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 ...

  5. 如何利用Emacs进行个人时间管理(GTD)

    1. 简介 1.1 什么是GTD Get Things Done(GTD),是一套时间管理方法,面对生活中如下情况: 有很多事情要做 每件事情有主次之分 个人精力有限 我们需要随时很方便的了解我们下一 ...

  6. MapServer教程3

    Compiling on Unix Compiling on Win32 PHP MapScript Installation .NET MapScript Compilation IIS Setup ...

  7. Git for Windows v2.11.0 Release Notes

    homepage faq contribute bugs questions Git for Windows v2.11.0 Release Notes Latest update: December ...

  8. Canu Quick Start(快速使用Canu)

    Canu Quick Start Canu Quick Start PBcR (老版的canu) CA Canu specializes in(专门从事) assembling PacBio or O ...

  9. (转) Quick Guide to Build a Recommendation Engine in Python

    本文转自:http://www.analyticsvidhya.com/blog/2016/06/quick-guide-build-recommendation-engine-python/ Int ...

随机推荐

  1. lua-resty-kafka erro xxxx could not be resolved (3: Host not found)

    问题:使用 lua-resty-kafka 向 kafka 发送数据失败,报错如下: slave6 could not be resolved (: Host not found) 配置信息: lua ...

  2. 45 MySQL自增id

    45 MySQL自增id 表定义自增id 说到自增id,前面提到mysql的自增id不连续,当表定义的自增值达到上限后的逻辑是:再申请下一个id时,得到的值保持不变 ; insert into t v ...

  3. Where we love is home, home that our feet may leave, but not our hearts.

    parcel.n. 包裹 endurance.n.耐力 rot.v.腐烂 ornament.n.装饰 pinch.v.捏 nationality.n.国家 sunshine.n.阳光 stagger. ...

  4. State Function Approximation: Linear Function

    In the previous posts, we use different techniques to build and keep updating State-Action tables. B ...

  5. [10期]浅谈SSRF安全漏洞

    引子:SSRF 服务端请求伪造攻击 很多web应用都提供从其他服务器上获取数据的功能.使用用户指定的URL,web应用可以从其他服务器获取图片,下载文件,读取文件内容等. 这个功能被恶意使用的话,可以 ...

  6. Linux基础:Linux环境下安装JDK

    title: Linux基础:JDK的及环境变量配置 author: Enjoyitlife.top date: 2019-10-09 20:50:36 tags: Linux JDK categor ...

  7. Java-第N篇推荐的一些学习书籍

    1.推荐的一些学习书籍或者需要掌握的基本知识 book | |---ant | |---maven | |---git(菜鸟教程) | |---Dos shell | |---linux常用的命令.l ...

  8. [2019杭电多校第三场][hdu6608]Fansblog

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6608 大致题意是比p小的最大素数q,求q!%p的值. 由威尔逊定理开始推: $(p-1)!\equiv ...

  9. WOJ#4709 迷路

    WOJ#4709 迷路 题目描述 dolls意外得到了一张藏宝图,于是他踏上了寻找宝藏的道路.在走了许多许多步,回到同一个位置以后,dolls确定自己迷路了.dolls十分生气,他觉得自己这么英明圣武 ...

  10. 小白学Python(11)——pyecharts,绘制饼图 Pie

    Pie-基本示例 from example.commons import Faker from pyecharts import options as opts from pyecharts.char ...