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. 1) B. 0-1 MST 圖論
D. MST Ujan has a lot of useless stuff in his drawers, a considerable part of which are his math notebooks: it is time to sort them out. This time he found an old dusty graph theory notebook with a de ...
2019-11-07 17:08 0 389 推薦指數：
相關推薦
Codeforces Round #694 (Div. 2) B. Strange List
B. Strange List 題目分析 題意：給你一個長度為n的數組和一個數字x，從第一個元素開始，如果改元素q能被x整除，那么將就在數組后面新增x個(q / x)，直到遇到的元素不能被x整除，求最后數組的元素之和 讓我們從樣例開始入手分析：樣例中的第一個情況數組a為[12]，x為2，數組 ...
Codeforces Round #661 (Div. 3) B. Gifts Fixing（思維）
You have n gifts and you want to give all of them to children. Of course, you don't want to offend a ...
Codeforces Round #643 (Div. 2) B. Young Explorers（貪心）
Young wilderness explorers set off to their first expedition led by senior explorer Russell. Explore ...
Codeforces Round #626 （Div. 2） B. Count Subrectangles
題目連接：https://codeforces.com/contest/1323/problem/B 題意：給一個大小為n的a數組，一個大小為m的b數組，c數組是二維數組c[i][j]=a[i]*b[j]，問面積為k的矩形有幾個。 題解：先把k的所有因子存入一個數組里，然后遍歷因子，表示 ...
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 Ujan makes at most 2𝑛 swaps. In addition ...
Codeforces Round #333 (Div. 1) B. Lipshitz Sequence 倍增 二分
B. Lipshitz Sequence Time Limit: 20 Sec Memory Limit: 256 MB 題目連接 http://codeforces.com/contest/601/problem/B Description A function is called ...
Codeforces Round #603 (Div. 2) B. PIN Codes 水題
B. PIN Codes A PIN code is a string that consists of exactly 4 digits. Examples of possible PIN codes: 7013, 0000 and 0990. Please note that the PIN ...