数论
文章平均质量分 75
yyPurpose_forever
FIGHTING
展开
-
欧拉函数
转载自:http://www.cnblogs.com/handsomecui/p/4755455.html一欧拉函数(Euler's totient function) 欧拉函数的定义: 在数论中,对于正整数N,少于或等于N ([1,N]),且与N互质的正整数(包括1)的个数,记作φ(n)。 φ函数的值: φ(x)=x(1-1/p转载 2017-07-31 21:02:24 · 240 阅读 · 0 评论 -
poj2661(Stirling公式)
Factstone BenchmarkTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4699 Accepted: 2240DescriptionAmtel has announced that it will release a 128-bit co原创 2018-01-20 20:42:12 · 251 阅读 · 0 评论 -
hdu2973 & hdu5391(威尔逊定理)
威尔逊定理:当且仅当p为质数时:( p -1 )! ≡ -1 ( mod p )或者这么写( p -1 )! ≡ p-1 ( mod p )或者说若p为质数,则p能被(p-1)!+1整除hdu2973YAPTCHATime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/原创 2018-02-18 20:52:42 · 286 阅读 · 0 评论 -
zoj4006 & ZOJ 2018三月月赛C(扩展欧几里德,lucas定理)
151 - ZOJ Monthly, March 2018 - CTravel along the LineTime Limit: 1 Second Memory Limit: 65536 KBBaoBao is traveling along a line with infinite length.At the beginning of his trip,原创 2018-03-10 18:50:46 · 289 阅读 · 0 评论 -
hdu4767(bell数+矩阵快速幂+中国剩余定理)
BellTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 893 Accepted Submission(s): 400Problem DescriptionWhat? MMM is learning C原创 2018-02-25 22:41:45 · 256 阅读 · 0 评论 -
poj3358(欧拉定理)
Period of an Infinite Binary ExpansionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3670 Accepted: 1033DescriptionLet {x} = 0.a1a2a3... be the binar原创 2018-03-13 00:14:23 · 246 阅读 · 0 评论 -
牛客练习赛15-D(杨辉三角,组合数,逆元)
链接:https://www.nowcoder.com/acm/contest/83/D来源:牛客网时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述有n(n≤500000) 个人排成一列,把他们解散后重排,使得"重排后前方" 跟"原排列前方" 一样的人不超过k(k<n) 个,问有几种方法数,...原创 2018-04-14 15:41:15 · 285 阅读 · 0 评论 -
hdu6069(大区间素数)
Counting DivisorsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 3713 Accepted Submission(s): 1366Problem DescriptionIn ma原创 2018-04-03 19:35:34 · 503 阅读 · 0 评论 -
codeforces 963a(等比数列求和 逆元 快速幂)
A. Alternating Sumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two integers aa and bb. M原创 2018-04-19 14:47:07 · 298 阅读 · 0 评论 -
指数循环节问题学习&&补题
参考:https://blog.csdn.net/acdreamers/article/details/8236942今天来学习一个新的东西---指数循环节。在有些题目中我们需要对指数进行降幂处理才能计算。比如计算 其中和 这里由于很大,所以需要进行降幂。那么实际上有如下降幂公式 有了上述公式,很多题目就可以迎刃而解了。...原创 2018-07-31 16:26:38 · 499 阅读 · 0 评论 -
hdu6363(杭电多校第六场2)容斥、数学公式
bookshelfTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 449 Accepted Submission(s): 207Problem DescriptionPatrick Star bought a books...原创 2018-08-10 21:44:23 · 265 阅读 · 0 评论 -
hdu5909(树形dp+fwt)
Tree CuttingTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 1298 Accepted Submission(s): 501Problem DescriptionByteasar has a tree T...原创 2018-08-12 19:25:44 · 303 阅读 · 0 评论 -
牛客2018暑假多校训练八-H(fwt)
链接:https://www.nowcoder.com/acm/contest/146/H来源:牛客网 时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述Niuniu likes playing games. He has n piles of stones. The i-th ...原创 2018-08-13 08:50:58 · 518 阅读 · 0 评论 -
牛客2018暑假多校训练九-E(期望)
链接:https://www.nowcoder.com/acm/contest/147/E来源:牛客网 时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述Niuniu likes to play OSU!We simplify the game OSU to the foll...原创 2018-08-17 21:41:40 · 250 阅读 · 0 评论 -
狄利克雷卷积、杜教筛学习
今天才知道有杜教筛这个逆天的东西,实在惭愧,学习了,先放上链接,后面再补题。https://blog.csdn.net/hzj1054689699/article/details/75091655这个也写得很好:https://blog.csdn.net/u011495472/article/details/50460409hdu5608functionTime Limit: ...原创 2018-08-30 21:35:16 · 181 阅读 · 0 评论 -
ACM-ICPC 2018南京赛区网络预赛 J Sum(线性筛)
A square-free integer is an integer which is indivisible by any square number except 11. For example, 6 = 2 \cdot 36=2⋅3 is square-free, but 12 = 2^2 \cdot 312=22⋅3 is not, because 2^222 is a square n...原创 2018-09-02 21:57:24 · 787 阅读 · 2 评论 -
poj3270(置换)
Cow SortingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7730 Accepted: 3038DescriptionFarmer John's N (1 ≤ N ≤ 10,000) cows are lined up to be milk原创 2018-01-28 14:31:20 · 376 阅读 · 0 评论 -
hdu2082(母函数)
找单词Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8714 Accepted Submission(s): 6069Problem Description假设有x1个字母A, x2个字母B,....原创 2018-01-19 20:34:19 · 371 阅读 · 0 评论 -
poj2409 & poj2154 & hdu4633(Polya定理)
Let it BeadTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6242 Accepted: 4187Description"Let it Bead" company is located upstairs at 700 Cannery Row原创 2018-01-26 16:52:49 · 311 阅读 · 0 评论 -
poj1061(扩展欧几里德)
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 118649 Accepted: 24926Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直原创 2017-08-25 20:56:44 · 178 阅读 · 0 评论 -
poj3734(矩阵快速幂)
BlocksTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7108 Accepted: 3440DescriptionPanda has received an assignment of painting a line of blocks. Sin原创 2017-09-24 21:36:11 · 273 阅读 · 0 评论 -
poj3735(矩阵快速幂)
Training little catsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14625 Accepted: 3619DescriptionFacer's pet cat just gave birth to a brood of littl原创 2017-09-01 16:20:21 · 264 阅读 · 0 评论 -
hdu2588(欧拉函数)
GCDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2461 Accepted Submission(s): 1271Problem DescriptionThe greatest common di原创 2017-09-19 16:25:54 · 375 阅读 · 0 评论 -
poj1284(欧拉函数、原根)
Primitive RootsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4639 Accepted: 2744DescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is eq原创 2017-09-19 20:16:21 · 410 阅读 · 0 评论 -
codeforces 869c(组合数)
C. The Intriguing Obsessiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output— This is not playing but duty a原创 2017-10-07 14:47:29 · 1171 阅读 · 0 评论 -
poj2992(求因子个数)
DivisorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12022 Accepted: 3587DescriptionYour task in this problem is to determine the number of divisor原创 2017-09-21 19:28:19 · 276 阅读 · 0 评论 -
poj2773(互质)
Happy 2006Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 12662 Accepted: 4456DescriptionTwo positive integers are said to be relatively prime to each原创 2017-09-21 20:15:12 · 246 阅读 · 0 评论 -
hdu5968(组合数取模Lucas定理)
瞬间移动Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1460 Accepted Submission(s): 703Problem Description有一个无限大的矩形,初始时你在左上角(即第一原创 2017-11-09 15:18:35 · 231 阅读 · 0 评论 -
hdu5446(组合数取模 Lucas定理 中国剩余定理)
Unknown TreasureTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3047 Accepted Submission(s): 1122Problem DescriptionOn the原创 2017-11-11 16:07:11 · 268 阅读 · 0 评论 -
组合数取模之逆元
Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu LightOJ 1067 DescriptionGiven n different objects, you want to take k of them. How many ways to can do转载 2017-12-22 22:56:51 · 221 阅读 · 0 评论 -
zoj3435(莫比乌斯反演+数论分块)
Ideal Puzzle BobbleTime Limit: 2 Seconds Memory Limit: 65536 KBHave you ever played Puzzle Bobble, a very famous PC game? In this game, as a very cute bobble dragon, you must keep shoot原创 2018-01-24 13:56:54 · 458 阅读 · 0 评论 -
codeforces919e(逆元 同余方程)
E. Congruence Equationtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven an integer x. Your task is to原创 2018-02-01 16:00:23 · 179 阅读 · 0 评论 -
poj2689(素数)
Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20218 Accepted: 5438DescriptionThe branch of mathematics called number theory is about p原创 2018-01-25 17:14:39 · 193 阅读 · 0 评论 -
codeforces617e(莫队算法)
E. XOR and Favorite Numbertime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob has a favorite number k and原创 2018-02-01 19:21:19 · 305 阅读 · 0 评论 -
NTT学习
学习:https://blog.csdn.net/VictoryCzt/article/details/81005812模板:https://blog.csdn.net/ransln/article/details/79462659只是简单地学习了下,时间紧迫,主要还是找了个模板。例题:hdu5829Rikka with SubsetTime Limit: 6000/300...原创 2018-10-09 13:48:12 · 400 阅读 · 0 评论