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 ...