数论
文章平均质量分 86
iambabao
这个作者很懒,什么都没留下…
展开
-
HDU5726-GCD 区间GCD+二分
GCDTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4611 Accepted Submission(s): 1655Problem DescriptionGive you a sequence of N(N≤100,000) i...原创 2018-02-08 16:41:17 · 257 阅读 · 0 评论 -
模板:区间GCD
一、RMQ实现 RMQ不能实现更新。#include <iostream>#include <sstream>#include <iomanip>#include <string>#include <numeric>#include <vector>#include <queue>#in原创 2018-02-09 16:21:14 · 543 阅读 · 0 评论 -
Codeforces Round#458Div.1+2 D.Bash and a Tough Math Puzzle 区间GCD
D. Bash and a Tough Math Puzzletime limit per test2.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBash likes playing with arrays. He has an array a1, a2, ... an of...原创 2018-02-09 15:50:26 · 285 阅读 · 0 评论 -
POJ1006-Biorhythms 中国剩余定理
BiorhythmsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 143074 Accepted: 46000DescriptionSome people believe that there are three cycles in a person's life that start the day he or she is ...原创 2018-03-23 22:09:31 · 192 阅读 · 0 评论 -
POJ1012-Joseph 约瑟夫环问题
JosephTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 56986 Accepted: 21688DescriptionThe Joseph's problem is notoriously known. For those who are not familiar with the original problem: fro...原创 2018-04-07 22:56:23 · 940 阅读 · 1 评论 -
模板:欧几里得 扩展欧几里得 乘法逆元
一、欧几里得算法 求a,b的最小公约数。int GCD(int a, int b) { int r; while (b) { r = a % b; a = b; b = r; } return a;}二、扩展欧几里得 求解方程ax + by = gcd(a, b),并返回gcd(a,b)。 简单证明://求解ax + by = gcd...原创 2018-03-26 15:29:54 · 338 阅读 · 0 评论 -
模板:中国剩余定理
一、m[]两两互质时 简单证明: 必要时数据类型改为long long#include <iostream>#include <sstream>#include <iomanip>#include <string>#include <numeric>#include <vector>#i...原创 2018-03-26 22:04:38 · 161 阅读 · 0 评论