摘要:
problemsolutioncodes#includeusing namespace std;int fa[200010];int find(int x){return x==fa[x] ? x : fa[x]=find(fa[x]);}int main(){ ... 阅读全文
摘要:
problemsolutioncodes#include#include#define maxn 200020using namespace std;int n, m;struct UndirectedEdge{ int u, v, w; Undirect... 阅读全文
摘要:
problem给定一个范围N回答M个某数字是否为质数的询问(Msolutioncodes#include#define maxn 10000010using namespace std;int pri[maxn];int main(){ int n, m; c... 阅读全文