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. 2) B2. Character Swap (Hard Version) 构造
B . Character Swap Hard Version This problem is different from the easy version. In this version Ujan makes at most swaps. In addition, , and it is necessary to print swaps themselves. You can hack th ...
2019-11-07 16:43 0 310 推荐指数：
相关推荐
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. Fi ...
Codeforces Round #602 (Div. 2, based on Technocup 2020 Elimination Round 3) F2. Wrong Answer on test 233 (Hard Version) dp 数学
F2. Wrong Answer on test 233 (Hard Version) Your program fails again. This time it gets "Wrong answer on test 233" . This is the harder version ...
Educational Codeforces Round 78 (Rated for Div. 2) B - A and B（思维）
😢 😢 😢 题意：第 i 步可以挑一个数字加 i ，问你最少多少步能让两个数字相等 假设刚开始两个数字相等，然后一个数字向前走了abs（b-a）步，由等差数列求和公式，这时候我们贪心的让另外一个数字走大于等于abs（b - a）的最小步数，然后如果两数相等必须满足走的步数之和 ...
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 #694 (Div. 2) B. Strange List
B. Strange List 题目分析 题意：给你一个长度为n的数组和一个数字x，从第一个元素开始，如果改元素q能被x整除，那么将就在数组后面新增x个(q / x)，直到遇到的元素不能被x整除，求最后数组的元素之和 让我们从样例开始入手分析：样例中的第一个情况数组a为[12]，x为2，数组 ...
Codeforces Round #441 Div. 2 A B C D
题目链接 A. Trip for Meal 题意 三个点之间两两有路径，分别长为\(a,b,c\)，现在从第一个点出发，走\(n-1\)条边，问总路径最小值。 思路 记起始点相邻的边为\(a,b\)，相对的边为\(c\). 首先肯定走\(a,b\)中的最小值（不妨设为\(a\)），到达 ...
Codeforces Round #612 (Div. 2)/A/B/C/D
codeforces-1287-A A. Angry Students time limit per test ...