Codeforces Round #598 (Div. 3) C. Platforms Jumping
There is a river of width n">nn. The left bank of the river is cell 0">00 and the right bank is c ...
原文：Codeforces Round #728 (Div. 2) C. Great Graphs
Great Graphs 题意 给你一个数组 d ， d i 表示从节点 到其他各个节点的最短路的长度，然后你可以对这个图进行加边 可以是负边 ，但不允许存在一个权值和为负数的回路。 题解 按样例的思想，大概就是将这些点按距离 的距离从小到大排个序，这样就使得所有点连成一条直线，这样总是可以保证加最多的负边，然后就开始加负边，对于每个点，将他和他前面的点全连上，这样就可以保证加足够多的负边且没有负 ...
2021-06-28 15:09 0 187 推荐指数：
相关推荐
Codeforces Round #566 (Div. 2) C. Beautiful Lyrics
链接： https://codeforces.com/contest/1182/problem/C 题意： You are given n words, each of which consists of lowercase alphabet letters. Each word ...
Codeforces Round #729 (Div. 2) C. Strange Function (数学)
题意: \(f(i)=x\),\(x\)为最小的不能整除\(i\)的数.求\(\sum^{n}_{i=1}f(i)\ mod\ 10^9+7\). 题解:首先,\(1,2,..., ...
Codeforces Round #554 (Div. 2) C. Neko does Maths
C. Neko does Maths time limit per test 1 second memory limit per test 256 megabytes input standard ...
Codeforces Round #735 (Div. 2) C. Mikasa
Codeforces Round #735 (Div. 2) C. Mikasa ps:代码最后调出来来不及交了，没有AC，纯属口嗨 qwq 本质是找个最小的k使得n^k>m \(n > m\) 则答案为0 下面描述的n的变化量即为要找的k。 1、找到n最高的值为1且不与m ...
Codeforces Round #590 (Div. 3) C. Pipes
链接: https://codeforces.com/contest/1234/problem/C 题意: You are given a system of pipes. It consists of two rows, each row consists of n pipes. ...
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 #327 (Div. 2) B. Rebranding C. Median Smoothing
B. Rebranding The name of one small b ...