摘要: CF Problem - 1234C - Codeforces(贪心) #include <bits/stdc++.h> using namespace std; #define LL long long const LL mod = 998244353; const int N=2e5+10; s 阅读全文
posted @ 2025-11-21 21:34 Seren_blingbling 阅读(4) 评论(0) 推荐(0)
摘要: CF Problem - 982C - Codeforces(搜索)(dfs) 找最大删除边数,使得每一棵树的顶点数都为偶数 #include <bits/stdc++.h> using namespace std; #define LL long long const LL mod = 99824 阅读全文
posted @ 2025-11-21 19:08 Seren_blingbling 阅读(3) 评论(0) 推荐(0)