A. Sweet Problem You have three piles of candies: red, green and blue candies: the fi ...

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

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 ps:代码最后调出来来不及交了，没有AC，纯属口嗨 qwq 本质是找个最小的k使得n^k>m \(n > m\) 则答案为0 下面描述的n的变化量即为要找的k。 1、找到n最高的值为1且不与m ...

链接: 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. ...

链接： https://codeforces.com/contest/1182/problem/C 题意： You are given n words, each of which consists of lowercase alphabet letters. Each word ...

题意: \(f(i)=x\),\(x\)为最小的不能整除\(i\)的数.求\(\sum^{n}_{i=1}f(i)\ mod\ 10^9+7\). 题解:首先,\(1,2,..., ...