Star77777的博客

欧拉筛法求素数将所有合数标记，保证不被重复筛除，时间复杂度为O（n）#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int maxn = 3000050;int prime[maxn];...

#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <string>#include <queue>#include <stack>#include <map>

#include <cstdio>#include <cstring>#include <string>#include <iostream>#include <algorithm>using namespace std;string sub(string a, string b) { int i, j, k...

遍历所有左上角##include <bits/stdc++.h>using namespace std;#define ll long longconst int maxn = 1e3+5;int n, m, k; char mapp[maxn][maxn];int vis[maxn][maxn];bool f(int i, int j) { if (mapp...