求消耗最小的问题，一般都是bfs #define ll int #define inf 0x3ffffff #define MAX 205 #define vec vector<ll> ll N, A, B, K[MAX], res = inf, vis[MA...

https://blog.csdn.net/csyifanZhang/article/details/106044042 完整题解与解析↑   #define ll long long #define inf 0x3ffffff #define ...

 https://blog.csdn.net/csyifanZhang/article/details/106035134 ↑ 完整题解 struct E { ll t, f, h; }v[MAX]; bool cmp(E e1, E e2) {...

https://blog.csdn.net/csyifanZhang/article/details/106033659 ↑更好的阅读体验 本题要求的，就是找一个最小的数m，使得任意两个数x，y，满足：  (x mod m) != (y mod m).&nbs...

#include<iostream> #include<cstdio> #include<string> #include<string.h> #include<algorithm> #include<map>...

 逐对spfa水过 #include<iostream> #include<cstdio> #include<string> #include<string.h> #include<algorithm> ...

埃及筛法找到所有范围内的素数，然后直接lowerbound即可， #define ll int #define MAX 20005 #define vec vector<ll> int main() { bool isP[MAX]; vec primes; ...

#include<iostream> #include<cstdio> #include<string> #include<string.h> #include<cmath> #include<map> #...