Codeforces Round #599 (Div. 1) B. 0-1 MST 图论
D. 0-1 MST Ujan has a lot of useless stuff in his drawers, a considerable part of which are his mat ...
原文：Codeforces Round #599 (Div. 1) A. Tile Painting 数论
C. Tile Painting Ujan has been lazy lately, but now has decided to bring his yard to good shape. First, he decided to paint the path from his house to the gate. The path consists of consecutive tiles, ...
2019-11-07 16:50 1 360 推荐指数：
相关推荐
Codeforces Round #661 (Div. 3) A. Remove Smallest
You are given the array aa a consisting of n positive (greater than zero) integers. In one move, yo ...
Codeforces Round #599 (Div. 2) D. 0-1 MST(bfs+set)
Codeforces Round #599 (Div. 2) D. 0-1 MST Description Ujan has a lot of useless stuff in his drawers, a considerable part of which are his math ...
Codeforces Round #599 (Div. 2) B2. Character Swap (Hard Version) 构造
B2. Character Swap (Hard Version) This problem is different from the easy version. In this version ...
Educational Codeforces Round 108 (Rated for Div. 2) A. Red and Blue Beans（思维）
You have r red and b blue beans. You'd like to distribute them among several (maybe, one) packets in ...
Codeforces Round #739 (Div. 3)
Codeforces Round #739 (Div. 3) div3掉大分，不考算法考手速真来不及，还是得多练 目录： A. Dislike of Threes B. Who's Opposite? C. Infinity Table D. Make a Power of Two ...
Codeforces Round #614 (Div. 2)
A. ConneR and the A.R.C. Markland-N 题目链接：https://codeforces.com/contest/1293/problem/A 题意： 有一个长为 n 的楼层，其中有 k 个楼层没有餐厅 ，你现在在 s 层，问你最少走多少个楼层可以到达餐厅吃饭 ...
Codeforces Round #615 (Div. 3)
A. Collecting Coins 题目链接：https://codeforces.com/contest/1294/problem/A 题意： 你有三个姐妹她们分别有 a , b , c枚硬币，你有n枚，你可以把硬币随意分给她们（必须分完），使她们的硬币数A = B = C 分析 ...