growing_up_的博客

//hdu2544 #include #include #include #include #include #define INF 0x3f3f3f3f using namespace std; const int maxn = 100010; struct edge { int to, w, next; }e[maxn]; int head[maxn], dist[maxn], visit

//欧拉筛 #include #include #include #include #define ll long long using namespace std; const int maxn = 1000010; bool visited[maxn]; vectorprime; //欧拉筛模板 void isprime() { for (int i = 2; i < maxn; i