激励

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

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. K近邻实战手写数字识别

    1.导包 import numpy as np import operator from os import listdir from sklearn.neighbors import KNeighb ...

  2. Parameter setting for Jemeter Post method

    1. create CSV file note: the first line is parameter name 2. Add Controller Edit >Add >Logic C ...

  3. Tensorflow之CNN卷积层池化层padding规则

    padding的规则 ·        padding=‘VALID’时,输出的宽度和高度的计算公式(下图gif为例) 输出宽度:output_width = (in_width-filter_wid ...

  4. Vue—非父子组件间的传值(Bus/发布订阅模式/观察者模式/总线)

    <!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8&quo ...

  5. Python 中的作用域?

    Python 中,一个变量的作用域总是由在代码中被赋值的地方所决定. 当 Python 遇到一个变量的话,它会按照这的顺序进行搜索:本地作用域(Local)--->当前作用域被嵌入的本地作用域( ...

  6. 2019牛客暑期多校训练营(第三场) - D - Big Integer - 数论

    https://ac.nowcoder.com/acm/contest/883/D \(A(n)\) 是由n个1组成的一个整数. 第一步:把 \(A(n)\) 表示为 \(\frac{10^n-1}{ ...

  7. Angular 组件通讯方式

    (一)父子组件 输入/输出属性    关键词  Input,Output,EventEmitter. 父子组件信息信息,分为 (1)子组件向父组件传递 (2)父组件向子组件传递 (二)模版变量与 @V ...

  8. 搜索(DFS)---好友关系的连通分量数目

    好友关系的连通分量数目 547. Friend Circles (Medium) Input: [[1,1,0], [1,1,0], [0,0,1]] Output: 2 Explanation:Th ...

  9. JS同步执行代码

    new Promise(function(){initAppToken()}).then(()=>                     getApps(this.pageInfo).then ...

  10. 2018-11-15-UWP-how-to-get-the-touch-width

    title author date CreateTime categories UWP how to get the touch width lindexi 2018-11-15 18:49:12 + ...