随笔分类 - 模拟赛
摘要:1 #include<bits/stdc++.h> 2 #define ll long long 3 using namespace std; 4 const ll N=51; 5 ll n,m,fac[N]; 6 7 inline ll Calc(ll i,ll j,ll ii,ll jj) {
阅读全文
摘要:1 #include<bits/stdc++.h> 2 #define ll long long 3 using namespace std; 4 ll n,ans; 5 int main() 6 { 7 freopen("star.in","r",stdin); 8 freopen("star.o
阅读全文
摘要:1 #include<bits/stdc++.h> 2 #define ll long long 3 using namespace std; 4 inline ll re_ad() { 5 char ch=getchar(); ll x=0,f=1; 6 while(ch<'0' || ch>'9
阅读全文
摘要:1 #include<bits/stdc++.h> 2 using namespace std; 3 inline int re_ad() { 4 char ch=getchar(); int x=0,f=1; 5 while(ch<'0' || '9'<ch) { if(ch=='-') f=-1
阅读全文
摘要:1 #include<bits/stdc++.h> 2 #define ll long long 3 using namespace std; 4 inline ll re_ad() { 5 char ch=getchar(); ll x=0,f=1; 6 while(ch<'0' || ch>'9
阅读全文
摘要:1 #include<bits/stdc++.h> 2 using namespace std; 3 const int N=2e5+11,M=4e5+11; 4 int n,ans,siz[N]; 5 int to[M],nxt[M],id[M],edge,head[N]; 6 7 inline
阅读全文
摘要:1 #include<bits/stdc++.h> 2 #define ll long long 3 using namespace std; 4 const ll N=1e6+11; 5 ll n,m,fa[N],l[N],r[N],seg[N],zh; 6 bool vis[N]; 7 8 in
阅读全文
摘要:1 #include<bits/stdc++.h> 2 #define ll long long 3 using namespace std; 4 const ll db[11][11]={ 5 {0}, 6 {0,0}, 7 {0,-1,1}, 8 {0,-1,-2,8}, 9 {0,2,3,4,
阅读全文
摘要:1 #include<bits/stdc++.h> 2 #define ll long long 3 using namespace std; 4 const int N=2e6+11,M=61,L=(1<<13)+11,St=(1<<13); 5 int n,a[M]; 6 int tot,fr[
阅读全文
摘要:1 #include<bits/stdc++.h> 2 using namespace std; 3 const int N=1e3+11,St=1e3,mod=1e4; 4 int dp[N][N],sum[N][N]; 5 6 inline int re_ad() { 7 char ch=get
阅读全文
摘要:1 #include<bits/stdc++.h> 2 #define ll long long 3 using namespace std; 4 const ll N=1e6+11,St=1e6,mod=998244353; 5 ll T,n,A,B,dp[N]; 6 7 inline ll re
阅读全文
摘要:1 #include<bits/stdc++.h> 2 #define ll long long 3 using namespace std; 4 const ll N=51; 5 ll n,m,a[N],lj[N],ans,sum,len,tmp; 6 7 inline ll re_ad() {
阅读全文
摘要:1 #include<bits/stdc++.h> 2 #define int long long 3 using namespace std; 4 const int N=1e5+11; 5 int n,h[N],a[N],ans[N]; 6 int sta[N],top; 7 8 inline
阅读全文
摘要:1 #include<bits/stdc++.h> 2 using namespace std; 3 const int N=5011,mod=1e9+7; 4 int n,m,dp[N][N],g[N][N]; 5 char s[N],t[N]; 6 int main() 7 { 8 scanf(
阅读全文

浙公网安备 33010602011771号