```cpp #include #include using namespace std; const int maxn = 1e6+10; int n,x,m[maxn]; int f1(int k) { int l = 1,r = n; while(l >1; if(m[mid]>k) r = mid-1; els…

```cpp #include #include using namespace std; int t,d,x,y,n,m,k; int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 }; char map[1010][1010]; bool vis[1010][1010]; int…

在讨论《dfs mle》回复：

@[always_green](luogu://user/1004606)开小了re了

```cpp #include #include using namespace std; #define int long long const int maxx = 5e8; int n, m, k[30],cnt,p[100001]; bool prime[maxx]; void isprime(int x) {…

```cpp #include #include #include using namespace std; #define int long long const int N = 1e5 + 10; int n, m, q[N],k[N],sum; int search(int x) { int l = 0, r =…

```cpp #include using namespace std; int a,b; bool sushu(int x) { for(int i =2;i >a >> b; for(int i =a;i<=b;i++) if(jue(i)) cout << i << endl; return 0; } ```