链接: https: codeforces.com contest problem C 题意: You are an environmental activist at heart but the reality is harsh and you are just a cashier in a cinema. But you can still do something You have n ti ...
2019-10-07 13:29 0 385 推荐指数：
Codeforces Round #602 (Div. 2, based on Technocup 2020 Elimination Round 3) A. Math Problem 题意：有t组数据，每组数据给出n个范围[Li,Ri]，求与n个范围都有交集的最小范围[Ans_L,Ans_R ...
A.Math Problem（CF 1262 A） 题目大意：给定n条线段，求一条线段，使得这个线段能够跟所有给定的线段都相交（端点值一样也算相交），最小化它的长度，可以是0. 很显然找出这n条线 ...
Codeforces Round #692 (Div. 2, based on Technocup 2021 Elimination Round 3) 从传智杯到牛客到cf, 一条龙, 脑子有点呆 A - In-game Chat B - Fair Numbers 1~9的公倍数 ...
一、整体流程 做了A和B。 大胆猜想，直接写码…… 二、具体题目 A. Windblume Ode (1)读题 ①场上：从样例解释中发现，输出时的顺序无关紧要，换句话讲，输出1 2 3 ...
F2. Wrong Answer on test 233 (Hard Version) Your program fails again. This time it gets "Wrong answ ...
Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) 个人题解 比赛链接：Codeforces Round #759 (Div. 2, based on Technocup 2022 ...
Great Graphs 题意 给你一个数组\(d\)，\(d[i]\)表示从节点\(1\)到其他各个节点的最短路的长度，然后你可以对这个图进行加边（可以是负边），但不允许存在一个权值和为负数的回 ...
There is a river of width n">nn. The left bank of the river is cell 0">00 and the right bank is c ...
