随笔分类 - 模板
摘要：```cpp // 初始化n个元素 void init(int n) { for(int i=0;i
阅读全文
摘要：```cpp include include include include using namespace std; const int N=25; int a[N],len; long long l,r,dp[N][N]; long long dfs(int pos,int st,long lo
阅读全文
摘要：```cpp include include include include include include include include using namespace std; const int M=200005; int Cnt,n,m,l,r,k,q,ans,sum[M 1; build
阅读全文
摘要：```cpp include include include include include include include include using namespace std; const int N=105; int n,m,x,y,MAP[N][N],indegree[N]; void t
阅读全文
摘要：```cpp include include include include include include using namespace std; define ll long long const int Maxn=100001; int n,m,r,p,a[Maxn],x,y,now[Max
阅读全文
摘要：```cpp long long read(){ long long X=0,W=1; char ch=0; while(ch'9'){ if(ch=='-'){ W=-1; } ch=getchar(); } while(ch>='0'&&ch9){ out(X/10)...
阅读全文
摘要：```cpp include include include include include include include include using namespace std; const int N=200005; int n,m,s,tot,Next[N],head[N],to[N]; b
阅读全文
摘要：```cpp #include #include #include #include using namespace std; const int N=20005; int tot,n,ans; char s[55]; struct Node{ int pos,val; }trie[N][30]; void insert(char *s,int rt){ int Max=0,x; fo...
阅读全文
摘要：```cpp include include define Maxn 1000500 const double Pi=acos( 1); using namespace std; int n,m,r[Maxn 1] 1)|((i&1)?n 1:0); fft(b,1); fft(c,1);//DFT
阅读全文
摘要：```cpp include include include include include define MAXN 100010 define inf 0x3f3f3f3f using namespace std; struct node{ int l,r;//区间[l,r] int add;//
阅读全文
摘要：```cpp include include define Maxn 5000 define Pi 3.1415926535898 using namespace std; int n,m; struct complex {complex (double xx=0,double yy=0){x=xx
阅读全文
摘要：```cpp long long pow_mod(long long a,long long b,long long r){ long long ans=1,buff=a; while(b){ if(b&1) ans=(ans buff)%r; buff=(buff buff)%r; b =1; }
阅读全文
摘要：```cpp #include #include #include using namespace std; const int power = 1; //每次运算的位数为10的power次方，在这里定义为了方便程序实现 const int base = 10; //10的power次方。 //要压位的时候，只需改power 和 base即可，如压...
阅读全文
摘要：```cpp memset(isprime,1,sizeof(isprime)); isprime[1]=false; for(int i=2;i
阅读全文
摘要：```cpp include include include include include include include include using namespace std; const int N=10005,M=500005,INF=2147483647; int n,m,s,Cnt,d
阅读全文
摘要：```cpp include include include include include include using namespace std; using namespace std; const int N=500005; int cnt,fa[N],ans[N],head[N],rhea
阅读全文
摘要：```cpp include include include include include using namespace std; const int maxN=300; const int maxM=maxN maxN 4; const int inf=2147483647; class Ed
阅读全文
摘要：```cpp include include include include include include include using namespace std; const int N=205; bool gra[N][N],state[N]; int result[N],ans,n,m,s,
阅读全文
摘要：```cpp #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,m,n) for(i=m;i::iterator it=s.begin();i...
阅读全文
浙公网安备 33010602011771号