
Codeforces
acm
「已注销」
本博客现只用于学习用,可能会转载他人的知识,若有涉及到您的版权问题,请与我联系。
展开
-
Educational Codeforces Round 1303A #82 (Rated for Div. 2) A. Erasing Zeroes 解题思路 - 思维题
#include <iostream>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <cassert>#include <set>#include <map>#include &...原创 2020-02-13 00:36:18 · 456 阅读 · 0 评论 -
Educational Codeforces Round 1303B #82 (Rated for Div. 2) B. Perfect Keyboard 解题思路 - 思维题
#include <iostream>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <cassert>#include <set>#include <map>#include &...原创 2020-02-13 00:35:08 · 890 阅读 · 0 评论 -
Educational Codeforces Round 1303C #82 (Rated for Div. 2) C. Perfect Keyboard 解题思路 - 思维题&构造
#include <iostream>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <cassert>#include <set>#include <map>#include &...原创 2020-02-13 00:34:10 · 465 阅读 · 0 评论 -
Educational Codeforces Round 1303D #82 (Rated for Div. 2) D. Fill The Bag 解题思路 - 思维题&二进制
#include <iostream>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <cassert>#include <set>#include <map>#include &...原创 2020-02-13 00:29:21 · 380 阅读 · 0 评论 -
Codeforces Round 1299A #618 (Div. 1) A. Anu Has a Function 解题思路 -思维题&二进制
Codeforces Round #618 (Div. 1) A. Anu Has a FunctionAnu has created her own function ????: ????(????,????)=(????|????)−???? where | denotes the bitwise OR operation. For example, ????(11,6)=(11|6)−6=15−6=9. It can be proved...原创 2020-02-10 02:04:26 · 2862 阅读 · 1 评论 -
Codeforces Round 1300B #618 (Div. 2) B. Assigning to Classes 解题思路 - 思维题
Codeforces Round #613 (Div. 2) B. Assigning to ClassesReminder: the median of the array [????1,????2,…,????2????+1] of odd number of elements is defined as follows: let [????1,????2,…,????2????+1] be the elements of the arr...原创 2020-02-10 01:47:07 · 508 阅读 · 2 评论 -
Codeforces Round 1300A #618 (Div. 2) A. Non-zero 解题思路 - 思维题
Codeforces Round #618 (Div. 2) A. Non-zeroGuy-Manuel and Thomas have an array ???? of ???? integers [????1,????2,…,????????]. In one step they can add 1 to any element of the array. Formally, in one step they can cho...原创 2020-02-10 00:31:24 · 376 阅读 · 0 评论 -
Codeforces Round 1286B #612 (Div. 1) B. Numbers on Tree 解题思路 - DFS&构造&线段树
Codeforces Round #612 (Div. 1) B. Numbers on TreeEvlampiy was gifted a rooted tree. The vertices of the tree are numbered from 1 to ????. Each of its vertices also has an integer ???????? written on it. For e...原创 2020-02-08 10:16:20 · 693 阅读 · 0 评论 -
Codeforces Round 1286A #612 (Div. 1) A. Garland 解题思路 - 思维题&贪心
Codeforces Round #612 (Div. 1) A. GarlandVadim loves decorating the Christmas tree, so he got a beautiful garland as a present. It consists of ???? light bulbs in a single row. Each bulb has a number fr...原创 2020-01-30 22:16:11 · 976 阅读 · 0 评论 -
Codeforces Round 1286C2 #612 (Div. 1) C2. Madhouse (Hard version) 解题思路 - 排列组合&字符串
Codeforces Round #612 (Div. 1) C2. Madhouse (Hard version)This problem is different with hard version only by constraints on total answers lengthIt is an interactive problemVenya joined a tour to t...原创 2020-01-29 17:04:10 · 783 阅读 · 0 评论 -
Codeforces Round 1286C1 #612 (Div. 1) C1. Madhouse (Easy version) 解题思路 - 排列组合&字符串
Codeforces Round #612 (Div. 1) C1. Madhouse (Easy version)This problem is different with hard version only by constraints on total answers lengthIt is an interactive problemVenya joined a tour to t...原创 2020-01-29 16:47:33 · 745 阅读 · 0 评论