Codeforces Round #728 (Div. 2) C. Great Graphs
Great Graphs 题意 给你一个数组\(d\)，\(d[i]\)表示从节点\(1\)到其他各个节点的最短路的长度，然后你可以对这个图进行加边（可以是负边），但不允许存在一个权值和为负数的回 ...
原文：Codeforces Round #735 (Div. 2) C. Mikasa
Codeforces Round Div. C. Mikasa ps:代码最后调出来来不及交了，没有AC，纯属口嗨 qwq 本质是找个最小的k使得n k gt m n gt m 则答案为 下面描述的n的变化量即为要找的k。 找到n最高的值为 且不与m相同的一个二进制位，假设为第x位，代表的值为 x 若能找到这样的二进制位，因为要使n k gt m，那么n高于该位的值为 的位都应该向m补齐 补齐，即 ...
2021-07-30 01:15 0 173 推荐指数：
相关推荐
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 #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 #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 #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 #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 ...