摘要:
class Deque{public: int a[maxn]; int pl=1,pr=0;}Deq;int a[maxn];int n,k;void solve(){ Deq.pl=1;Deq.pr=0; for(int i=1;i<=n;i++){ while(Deq.pr>=Deq.pl&& 阅读全文
摘要:
#include<bits/stdc++.h> #define N 39989 using namespace std; const int mod=39989; const int modd=1e9; struct Seg { double k,b; Seg(){} Seg(int x0,int 阅读全文
摘要:
bool isP[Maxn]; long long Prime[Maxn],cnt=0; void GetPrime(){ for(long long i=1;i<Maxn;i++) isP[i]=1; isP[1]=0; for(long long i=2;i<Maxn;i++){ if(isP[ 阅读全文