Codeforces Round #749 (Div. 1 + Div. 2, based on Technocup 2022 Elimination Round 1) 赛后总结
一、整体流程 做了A和B。 大胆猜想，直接写码…… 二、具体题目 A. Windblume Ode (1)读题 ①场上：从样例解释中发现，输出时的顺序无关紧要，换句话讲，输出1 2 3 ...
原文：Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) 个人题解
Codeforces Round Div. , based on Technocup Elimination Round 个人题解 比赛链接：Codeforces Round Div. , based on Technocup Elimination Round A题 Life of a Flower 题目大意： 给出一颗植物和一个长度为 n 的 串， 表示当天不浇水， 表示当天浇水，并且满足连续 ...
2021-12-13 22:14 0 98 推荐指数：
相关推荐
Codeforces Round #602 (Div. 2, based on Technocup 2020 Elimination Round 3)
Codeforces Round #602 (Div. 2, based on Technocup 2020 Elimination Round 3) A. Math Problem 题意：有t组数据，每组数据给出n个范围[Li,Ri]，求与n个范围都有交集的最小范围[Ans_L,Ans_R ...
Codeforces Round #692 (Div. 2, based on Technocup 2021 Elimination Round 3)
Codeforces Round #692 (Div. 2, based on Technocup 2021 Elimination Round 3) 从传智杯到牛客到cf, 一条龙, 脑子有点呆 A - In-game Chat B - Fair Numbers 1~9的公倍数 ...
Codeforces Round #602 (Div. 2, based on Technocup 2020 Elimination Round 3)
A.Math Problem（CF 1262 A） 题目大意：给定n条线段，求一条线段，使得这个线段能够跟所有给定的线段都相交（端点值一样也算相交），最小化它的长度，可以是0. 很显然找出这n条线 ...
Codeforces Round #591 (Div. 2, based on Technocup 2020 Elimination Round 1) C. Save the Nature
链接: https://codeforces.com/contest/1241/problem/C 题意: You are an environmental activist at heart but the reality is harsh and you are just ...
Codeforces Round #602 (Div. 2, based on Technocup 2020 Elimination Round 3) F2. Wrong Answer on test 233 (Hard Version) dp 数学
F2. Wrong Answer on test 233 (Hard Version) Your program fails again. This time it gets "Wrong answ ...
Codeforces Round #704 (Div. 2) 题解
本场链接:Codeforces Round #704 (Div. 2) 闲话 大Fst场,排名从781->449,给我看傻了都.D题非常依赖特判,感觉我也不大能讲清楚所有情况.E的话好像也比较码农,正在写,可能晚上做出来了就更新,没做出来的话明天更. A. Three swimmers ...
Codeforces Round #702 (Div. 3) 题解
本场链接:Codeforces Round #702 (Div. 3) A. Dense Array B. Balanced Remainders C. Sum of Cubes 思路 枚举\(b\),由范围可以知道\(1 \leq b \leq 10^4\).\(a\)可以求 ...