摘要: O(n) 筛选素数#includeusing namespace std;const int M = 1e6 + 10 ;int mindiv[M] ;//每个数的最小质因数int prim[M] , pnum ;//存素数bool vis[M] ;void prim () { for... 阅读全文
posted @ 2015-08-21 14:35 92度的苍蓝 阅读(285) 评论(0) 推荐(0)
http://images.cnblogs.com/cnblogs_com/Running-Time/724426/o_b74124f376fc157f352acc88.jpg