codeforces
关注
分享
扫一扫
文章平均质量分 66
胡青云丶丶丶
这个作者很懒，什么都没留下…
展开
-
Codeforces Round #791 (Div. 2) C Rooks Defenders 三种解法
Codeforces Round #791 (Div. 2)C. Rooks Defenders原创 2022-05-16 22:16:58 · 351 阅读 · 0 评论 -
Codeforces Round #786 (Div. 3)ABCDE题解
Codeforces Round #786 (Div. 3) A - Number TransformationB - DictionaryC - Infinite ReplacementD - A-B-C SortE - Breaking the Wall原创 2022-05-04 11:42:55 · 460 阅读 · 0 评论 -
Codeforces Round #785 (Div. 2)ABC题解
Codeforces Round #785 (Div. 2)A. Subtle Substring SubtractionB. A Perfectly Balanced String?C. Palindrome Basis原创 2022-05-01 21:36:02 · 542 阅读 · 0 评论 -
Codeforces Round #782 (Div. 2)
Codeforces Round #782 (Div. 2)A - Red Versus BlueB - Bit FlippingC - Line Empire原创 2022-04-27 19:20:33 · 276 阅读 · 0 评论 -
Educational Codeforces Round 127 (Rated for Div. 2)ABC题解
Educational Codeforces Round 127 (Rated for Div. 2)A. String BuildingB. Consecutive Points SegmentC. Dolce Vita原创 2022-04-24 16:19:14 · 1354 阅读 · 0 评论 -
Codeforces Round #784 (Div. 4)题解
题目链接A - Division题意：根据分数输出段位。题解：签到题。code:#include<bits/stdc++.h>using namespace std;typedef long long ll;const ll inf = 0x3f3f3f3f3f3f3f3f;void solve() { int n; cin >> n; if (n >= 1900) printf("Division 1\n"); else if (n >= 1原创 2022-04-23 20:17:12 · 1284 阅读 · 0 评论 -
Codeforces Round #783 (Div. 2)ABC题解
Codeforces Round #783 (Div. 2)A Direction ChangeB Social DistanceC Make it Increasing原创 2022-04-20 18:31:56 · 933 阅读 · 1 评论