![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数学
Star77777
信息学
展开
-
Codeforces Round #441 div2 B. Divisiblity of Differences
B. Divisiblity of Differencestime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are given a multiset of n原创 2017-10-17 14:06:17 · 358 阅读 · 0 评论 -
欧拉筛法求素数(模板)
欧拉筛法求素数将所有合数标记,保证不被重复筛除,时间复杂度为O(n)#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int maxn = 3000050;int prime[maxn];...原创 2017-12-08 15:03:03 · 1107 阅读 · 0 评论