Codeforces
文章平均质量分 82
。
+0呐~
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #776 (Div. 3)
目录A. Deletions of Two Adjacent Letters题意解题思路代码B. DIV + MOD题意解题思路代码C. Weight of the System of Nested Segments题意解题思路代码A. Deletions of Two Adjacent Letters题意链接:A. Deletions of Two Adjacent Letters给出一个长度为奇数的字符串s(1≤t≤491 \le t\le491≤t≤49)和一个字符c,每一次操作可以把字符串原创 2022-03-15 21:30:21 · 413 阅读 · 0 评论 -
Codeforces Round #660 (Div. 2) A B C
目录A. Captain Flint and Crew Recruitment题意解题思路代码B. Captain Flint and a Long Voyage题意解题思路代码C. Uncle Bogdan and Country Happiness题意解题思路代码A. Captain Flint and Crew Recruitment题意链接:Captain Flint and Crew Recruitment定义一种数x叫nearly prime,x可表示为x=p*q,其中 1<p&原创 2020-07-31 21:55:09 · 211 阅读 · 0 评论 -
Educational Codeforces Round 92 (Rated for Div. 2) A、B、C
目录A. LCM Problem题意解题思路代码B. Array Walk题意解题思路代码C. Good String题意解题思路代码A. LCM Problem题意链接:LCM Problem给出 l 、r ,求 x 、y 满足 l<=x<y<=r 且 l<=LCM(x,y)<=r解题思路LCM(x,y)至少是min(x,y)的2倍,所以直接构造一组最小的解(l,2l),若2l>r则无解代码#include<stdio.h>#inc原创 2020-07-30 18:33:56 · 291 阅读 · 2 评论 -
Codeforces Round #659 (Div. 2) A 、C
目录A Common Prefixes题意解题思路代码C String Transformation 1题意解题思路代码A Common Prefixes题意链接:Common Prefixes给出一个长度为n的数组,其中a[i]表示字符串s[i-1]与s[i]的最长公共前缀的长度,求出字符串数组(任意解)解题思路找出a[i]的最大值为所有字符串的长度第0个字符串任意,为方便我们设为“aaa……aa”第i个字符串,在上一个字符串的a[i]位置++就可以了要注意字符串由小写母组成,要处原创 2020-07-25 10:43:07 · 365 阅读 · 0 评论 -
Codeforces Round #656 (Div. 3) A,B,C,D,(其他待补)
目录[ A. Three Pairwise Maximums](https://codeforces.ml/contest/1385/problem/A)[B. Restore the Permutation by Merger](https://codeforces.ml/contest/1385/problem/B)[C. Make It Good](https://codeforces.ml/contest/1385/problem/C)[D. a-Good String](https://codef原创 2020-07-18 17:26:54 · 152 阅读 · 0 评论