逆元
文章平均质量分 75
NOIAu
最后一天啦~
展开
-
POJ 1845 逆元最清真写法
DescriptionConsider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).InputThe only line contains the two nat原创 2017-09-19 12:16:05 · 699 阅读 · 0 评论 -
hdu 5673 线性求逆元+卡特兰数
gg了gg了,感觉自己一直在刷水题,我noip2017要报零了预处理卡特兰数,预处理组合数,然后夹棍法放不走的状态,线性处理逆元#include <cstdio>#include <iostream>#include <cstring>using namespace std;const int MAXN = 2000000 + 10;const long long wys = 100000原创 2017-09-19 17:34:43 · 1101 阅读 · 0 评论