![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
touso
这个作者很懒,什么都没留下…
展开
-
最小圆覆盖
Click Here#include <cstdio>#include <iostream>#include <cstring>#include <cmath>#include <cstdlib>#include <algorithm>#define EPS 1e-8using namespace std;const int maxn = 5500;double a[maxn][5];int n;struct p原创 2021-05-05 10:03:11 · 64 阅读 · 0 评论 -
POJ 2115
扩展欧几里得看不出来,我太菜了//扩展欧几里得#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>using namespace std;typedef long long ll;ll x,y;ll exgcd(ll a,ll b){ if(b==0) { x=1; y=0; return a; } ll c=exgcd(b,a%b原创 2020-09-26 08:49:39 · 71 阅读 · 0 评论