2019年11月8日
摘要: 1 #include <iostream> 2 using namespace std; 3 4 typedef long long LL; 5 6 LL gcd(LL a, LL b) 7 { 8 if (!b) return a; 9 return gcd(b, a % b); 10 } 11 阅读全文
posted @ 2019-11-08 23:06 thjkhdf12 阅读(164) 评论(0) 推荐(0)
摘要: int d[maxn]; int now[maxn]; int st,ed; void add_dinic(int u, int v) { e[++cnt].v = v; e[cnt].w = 0; e[cnt].nxt = head[u]; head[u] = cnt; } int dfs_din 阅读全文
posted @ 2019-11-08 22:46 thjkhdf12 阅读(147) 评论(0) 推荐(0)
摘要: 1 #include<iostream> 2 #include<queue> 3 #include<cstring> 4 using namespace std; 5 6 const int maxn = 60; 7 8 const int INF = 0x3f3f3f3f; 9 int n; 10 阅读全文
posted @ 2019-11-08 22:44 thjkhdf12 阅读(105) 评论(0) 推荐(0)