flytowns的博客

bfs #include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<queue> #include<cmath> using namespace std; typedef struct { int x; i...

dfs #include<iostream> #include<algorithm> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int Map[25][25]; int point; int book[20]; int ans[20]; ...

克鲁斯卡尔 #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> using namespace std; struct node { int val; int s; int e; } nn[10050]; int n, m; int...

优先队列 贪心 优先队列：每次加入队列 都将最大的放在队首（默认） #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<cmath> using namespace std; str...

扩展欧几里得 #include<iostream> #include<cstring> #include<cmath> #include<algorithm> #include<cmath> using namespace std; long long gcd(long long a,long long b) { if(b==0)...

质因数分解 #include<iostream> #include<cstring> #include<algorithm> #include<cmath> #include<cstdio> using namespace std; int a[1005]; //质因子 int b[1005]; //质因子的个数 const int ...

void biao() { memset(f, 0, sizeof(f)); int i, j; f[0]=1; f[1]=1; for(i=2; i<=N; i++) { if(f[i]==0) { for(j=i*2; j<=N; j+=i) { ...

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<string> #include<cmath> using namespace std; const int maxn = 1.5e7 + 10; int vis...