元元的圆圆-CSDN博客

原创 B. Box Fitting

Codeforces Round #711 (Div. 2) B B. Box Fitting You are given n rectangles, each of height 1. Each rectangle’s width is a power of 2 (i. e. it can be represented as 2x for some non-negative integer x). You are also given a two-dimensional box of width W. N

2021-04-02 19:12:08 138

原创 C. Tourist Problem

Codeforces Round #198 (Div. 2) C C. Tourist Problem Iahub is a big fan of tourists. He wants to become a tourist himself, so he planned a trip. There are n destinations on a straight road that Iahub wants to visit. Iahub starts the excursion from kilometer

2021-03-31 20:03:28 93

原创 B. Partial Replacement

Codeforces Round #710 (Div. 3) B B. Partial Replacement You are given a number k and a string s of length n, consisting of the characters ‘.’ and ’ * '. You want to replace some of the ‘*’ characters with ‘x’ characters so that the following conditions are

2021-03-27 10:59:48 303

原创 B. Nezzar and Lucky Number

Codeforces Round #698 (Div. 2) B B. Nezzar and Lucky Number Nezzar’s favorite digit among 1,…,9 is d. He calls a positive integer lucky if d occurs at least once in its decimal representation. Given q integers a1,a2,…,aq, for each 1≤i≤q Nezzar would like t

2021-03-27 09:35:20 75

原创 C1. k-LCM (easy version)

Codeforces Round #708 (Div. 2) C1 C1. k-LCM (easy version) It is the easy version of the problem. The only difference is that in this version k=3. You are given a positive integer n. Find k positive integers a1,a2,…,ak, such that: a1+a2+…+ak=n LCM(a1,a2,…,

2021-03-20 09:44:04 438 2

原创 B. Napoleon Cake

Codeforces Round #707 (Div. 2） B B. Napoleon Cake This week Arkady wanted to cook some pancakes (to follow ancient traditions) and make a problem about that. But then he remembered that one can’t make a problem about stacking pancakes without working at a

2021-03-17 19:11:28 140

原创 A. Alexey and Train

Codeforces Round #707 A A. Alexey and Train Alexey is travelling on a train. Unfortunately, due to the bad weather, the train moves slower that it should! Alexey took the train at the railroad terminal. Let’s say that the train starts from the terminal at

2021-03-15 19:34:46 122

原创 B. Max and Mex

Codeforces Round #706 (Div. 2) B B. Max and Mex You are given a multiset S initially consisting of n distinct non-negative integers. A multiset is a set, that can contain some elements multiple times. You will perform the following operation k times: Add t

2021-03-13 19:39:36 220

原创 A. ABC String

Educational Codeforces Round 105 (Rated for Div. 2) A. ABC String You are given a string a, consisting of n characters, n is even. For each i from 1 to n ai is one of ‘A’, ‘B’ or ‘C’. A bracket sequence is a string containing only characters “(” and “)”. A

2021-03-03 20:10:33 119 2

weixin_52594743的博客