摘要：
Codeforces Round #582 (Div. 3) A # include <bits/stdc++.h>using namespace std;typedef long long LL;const int MAXN=200;LL x[MAXN]; int main(){ int n; 阅读全文
posted @ 2022-02-26 22:56
fengzlj
阅读(49)
评论(0)
推荐(0)
摘要：
Codeforces Round #580 (Div. 2) A # include <bits/stdc++.h>using namespace std;const int MAXN=250;int a[MAXN],b[MAXN];int mm[MAXN];int main(){ int n,m 阅读全文
posted @ 2022-02-26 22:55
fengzlj
阅读(54)
评论(0)
推荐(0)
摘要：
Codeforces Round #581 (Div. 2) A # include <bits/stdc++.h>using namespace std;int main(){ string s; cin>>s; int len=s.size(); int ans=0; int flag=0; 阅读全文
posted @ 2022-02-26 22:55
fengzlj
阅读(127)
评论(0)
推荐(0)
摘要：
Educational Codeforces Round 71 (Rated for Div. 2) A # include <bits/stdc++.h>using namespace std;int main(){ int t; scanf("%d",&t); while(t--){ int 阅读全文
posted @ 2022-02-26 22:55
fengzlj
阅读(47)
评论(0)
推荐(0)
摘要：
1、一维状压DP糖果【蓝桥杯省赛】```cpp//糖果【蓝桥杯省赛】# include <bits/stdc++.h>using namespace std;const int MAXN=1<<21;int dp[MAXN],s[110];int main(){ memset(dp,-1,sizeo 阅读全文
posted @ 2022-02-26 22:54
fengzlj
阅读(46)
评论(0)
推荐(0)
摘要：
Codeforces Round #578 (Div. 2) A # include <bits/stdc++.h>using namespace std;int r[15];int main(){ int n; scanf("%d",&n); getchar(); char a; for(int 阅读全文
posted @ 2022-02-26 22:53
fengzlj
阅读(136)
评论(0)
推荐(0)
摘要：
Educational Codeforces Round 70 (Rated for Div. 2) A # include <bits/stdc++.h>using namespace std;int main(){ int T; scanf("%d",&T); while(T--){ stri 阅读全文
posted @ 2022-02-26 22:53
fengzlj
阅读(133)
评论(0)
推荐(0)
摘要：
Codeforces Round #579 (Div. 3) A # include <bits/stdc++.h>using namespace std;int p[300];int c[300];int b[300];int main(){ int q; scanf("%d",&q); whi 阅读全文
posted @ 2022-02-26 22:53
fengzlj
阅读(49)
评论(0)
推荐(0)
摘要：
Codeforces Round #575 (Div. 3) A # include <bits/stdc++.h>using namespace std;typedef long long LL;LL fff(LL a,LL b,LL c){ LL ans1=max(a,b); LL ans2= 阅读全文
posted @ 2022-02-26 22:52
fengzlj
阅读(18)
评论(0)
推荐(0)
摘要：
Codeforces Round #577 (Div. 2) A # include <bits/stdc++.h>using namespace std;typedef long long LL;const int MAXN=1e3+100;string s;int a[MAXN];int b[ 阅读全文
posted @ 2022-02-26 22:52
fengzlj
阅读(52)
评论(0)
推荐(0)
浙公网安备 33010602011771号