素数筛选
文章平均质量分 83
_大太阳_
有梦想就去追
展开
-
高效 大数素数打表
void prime () { int k = 0; for (int i=2; iN; i++) { if (!isprime[i]) { a[k++] = i; for (int j=i+i; jN; j+=i) isprime[j] = 1;原创 2015-10-09 16:05:33 · 642 阅读 · 0 评论 -
LightOJ 1197 Help Hanzo (区间素数筛选法)
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=70017#problem/M Help Hanzo Description Amakusa, the evil spiritual leader has captured the beautiful princess Nakururu. The r原创 2015-10-12 20:20:16 · 1089 阅读 · 0 评论 -
CodeForces 546D Soldier and Number Game(素数筛选)
http://codeforces.com/problemset/problem/546/D Soldier and Number Game time limit per test 3 seconds memory limit per test 256 megabytes input standard input outp原创 2015-11-28 15:57:20 · 481 阅读 · 0 评论