争取三天做完一套吧,太简单的就写一句话题解吧(其实也没多少会做的)。
自己做出来的在前面用*标记
agc007
*A - Shik and Stone
暴力dfs即可,直接判断个数
*B - Construct Sequences
https://www.cnblogs.com/zwfymqz/p/9706027.html
C - Pushing Balls
https://www.cnblogs.com/zwfymqz/p/9707414.html
agc015
*A - A+...+B Problem
结论题。
![](https://i-blog.csdnimg.cn/blog_migrate/8f900a89c6347c561fdf2122f13be562.gif)
![](https://i-blog.csdnimg.cn/blog_migrate/961ddebeb323a10fe0623af514929fc1.gif)
#include<cstdio> #include<iostream> #define LL long long using namespace std; main() { LL N, A, B; cin >> N >> A >> B; cout << max((LL)0, (N - 1) * B + A - (N - 1) * A - B + 1); return 0; }
*B - Evilator
大力特判
![](https://i-blog.csdnimg.cn/blog_migrate/8f900a89c6347c561fdf2122f13be562.gif)
![](https://i-blog.csdnimg.cn/blog_migrate/961ddebeb323a10fe0623af514929fc1.gif)
#include<cstdio> #include<iostream> #include<cstring> #define LL long long using namespace std; const int MAXN = 1e5 + 10; char s[MAXN]; main() { scanf("%s", s + 1); int N = strlen(s + 1); LL ans = 0; for(int i = 1; i <= N; i++) { if(s[i] == 'U') ans += (N - i) + (i - 1) * 2; else ans += (N - i) * 2 + (i - 1); } cout << ans; return 0; }
C - Nuske vs Phantom Thnook
https://www.cnblogs.com/zwfymqz/p/9681405.html
D - A or...or B Problem
https://www.cnblogs.com/zwfymqz/p/9670530.html
E - Mr.Aoki Incubator
https://www.cnblogs.com/zwfymqz/p/9711735.html
F - Kenus the Ancient Greek
https://www.cnblogs.com/zwfymqz/p/9677497.html
agc016
*A - Shrinking
https://www.cnblogs.com/zwfymqz/p/9677907.html
B - Colorful Hats
https://www.cnblogs.com/zwfymqz/p/9681405.html
C - +/- Rectangle
https://www.cnblogs.com/zwfymqz/p/9681961.html