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