素数筛选
三茶先生
life is so long,bu needs you to face~
展开
-
素数筛选
素数筛法是这样的: 1.开一个大的bool型数组prime[],大小就是n+1就可以了.先把所有的下标为奇数的标为true,下标为偶数的标为false. 2.然后: for( i=3; i { if(prime[i]) for( j=i+i; j } 3.最后输出bool数组中的值为true的单元的下原创 2016-04-14 19:22:16 · 245 阅读 · 0 评论 -
poj2635The Embarrassed Cryptographer(同余模+素数筛选+高精度求模)
The Embarrassed Cryptographer Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 14852 Accepted: 4071 Description The young and very promising cryptographer O原创 2017-08-08 10:17:33 · 273 阅读 · 0 评论