![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论 素数筛
obsorb_knowledge
心有不甘,呼唤着我
展开
-
2018 ACM-ICPC 中国大学生程序设计竞赛线上赛 Goldbach(2^63 次方内的素数判断,Miller-Rabin素数检测算法)
Description:Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states:Every even integer greater than 2 can be expressed as the sum...原创 2018-04-24 17:23:25 · 342 阅读 · 0 评论 -
Soldier and Number Game CodeForces - 546D ()
Two soldiers are playing a game. At the beginning first of them chooses a positive integer n and gives it to the second soldier. Then the second one tries to make maximum possible number of rounds. Ea...原创 2018-05-04 10:11:39 · 203 阅读 · 0 评论 -
Counting Divisors HDU - 6069 (区间素数筛 + 一个数的所有素因子的个数 + 约数定理 + 数学)
In mathematics, the function d(n)d(n) denotes the number of divisors of positive integer nn. For example, d(12)=6d(12)=6 because 1,2,3,4,6,121,2,3,4,6,12 are all 1212's divisors. In this problem, give...原创 2018-05-04 16:15:17 · 168 阅读 · 0 评论 -
GCD and LCM HDU - 4497 (考最大公约数和最小公倍数的本质了)
Given two positive integers G and L, could you tell me how many solutions of (x, y, z) there are, satisfying that gcd(x, y, z) = G and lcm(x, y, z) = L? Note, gcd(x, y, z) means the greatest common di...原创 2018-05-20 11:20:56 · 198 阅读 · 0 评论