qq_38924883的博客

http://acm.fzu.edu.cn/problem.php?pid=2300不用计算几何，要仔细观察，贪心即可。#include<iostream>#include<cstdio>using namespace std;typedef long long ll;int main(){ int t; cin>>t; ...

https://vjudge.net/contest/249960#problem/A要注意：ll 64位。mul操作时要用快速乘，不然会超精度。add操作时要取模。#include<iostream>#include<map>using namespace std;typedef long long ll;map<string,ll>mp;...

http://acm.hdu.edu.cn/showproblem.php?pid=5922图是完全图，权值为相邻2点的LCM。以1为起点到所有点为最小生成树即可。要用等差数列求和。#include<bits/stdc++.h>#define maxn 300005using namespace std;typedef long long ll;int mai...