Codeforces 1557c moamen and XOR (combinatorial thinking)

Title Link: Moamen and XOR General meaning Given n and k, let you construct a length of n n Sequence a [], each element less than 2 k 2^k ...

Posted by mr.rum on Sat, 01 Jan 2022 19:21:54 +0100

Codeforces 1548E Gregor and the Two Painters

Title Link Codeforces 1548E Gregor and the Two Painters General idea of the topic There are two sequences \ (\ {a \} \) and \ (\ {B \} \) with lengths of \ (n \) and \ (m \) respectively, so as to construct the grid of \ (n\times m \). The weight at \ ((i,j) \) is \ (a_i+b_j \), which is called grid \ ((i,j) \) is bad if the weight of grid \ (\ ...

Posted by Yaak on Sat, 04 Dec 2021 22:57:40 +0100

Codeforces Round #753 (Div. 3) (A~E)

A. Linear Keyboard General idea of the topic The first line gives you a string with a length of 26, representing the order of 26 letters, and the distance between adjacent letters is 1. The second line gives you a string and asks how long it took to walk from beginning to end. Problem solving ideas Just enumerate. AC code #inclu ...

Posted by sargus on Sat, 06 Nov 2021 03:11:24 +0100

Codeforces 1312E. Array Shrinking (interval DP stack)

linkkk Meaning: Give a length of n n The sequence of n for the same two adjacent numbers x x x can be replaced by a number x + ...

Posted by Nexy on Tue, 19 Oct 2021 23:28:07 +0200

Educational codeforces round 112 (rated for Div. 2)

A. PizzaForces A. PizzaForces Easy to understand, omitted Idea: simply be greedy. Divide n into such forms as n=10+x+10y, then 10y individuals use y large cakes, and the remaining 10+x uses three combinations of cakes to see which saves the most time AC_code: #include<bits/stdc++.h> using namespace std; typedef long long ll; int main( ...

Posted by jola on Thu, 16 Sep 2021 02:35:10 +0200