素数素数筛选法
文章平均质量分 67
黑脉金
这个作者很懒,什么都没留下…
展开
-
素数素数筛选法模板
void get_prime() { flag[2]=true; for(int i=3;i<=Max;i++) { flag[i++]=true; flag[i]=false; } if(Max%2!=0) flag[Max]=true; else flag[Max]=fals...原创 2018-07-28 16:43:23 · 205 阅读 · 0 评论 -
Sum of Consecutive Prime Numbers (暴力+素数筛选法)
Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer 53 has two repre...原创 2018-07-28 16:55:34 · 426 阅读 · 0 评论