Loading...
题目链接链接代码#include <iostream> #include <algorithm> using namespace...
题目链接题目链接代码#include <iostream> #include <algorithm> #include <v...
#include <iostream> #include <algorithm> #include <vector> ...
ll C(ll n,ll m){ ll ans = 1; for(ll i =1;i<=m;i++){ ans = ...
kruskalint n, m; // n是点数,m是边数 int p[N]; // 并查集的父节点数组 struct Edge...