## Codeforces Round #721 (Rated for Div2)

It's irritated. It's his liver A. And Then There Were K Meaning: Let me give you an n, and find the maximum value of ⹻ (⹻ - 1) & (⹻ - 2) & (⹻ - 3) &... (⹸) = 0 k thinking charge by the meterAfter converting the original number to binary, first of all, if you want to change the first bit to 0, yUTF-8...

Posted by nanobots on Fri, 21 May 2021 05:30:48 +0930

## CF1422F - Boring Queries,Gym102979C - Colorful Squares

CF1422F - Boring Queries translate Problem solution Because the answer is too big and needs to be modeled, it is obvious that it can not be solved with ordinary methods gcd ⁡ \gcd gcd method l c m \rm lcm lcm, so we can only decompose the prime factor, and then take the number of times of each UTF-8...

Posted by TouranMan on Sat, 18 Dec 2021 15:14:46 +1030

## Codeforces Deltix Round Summer 2021 [Div.1 + Div.2] problem-A-B solution

delivery 1556A - A Variety of Operations 1556B - Take Your Places! catalogue A. A Variety of Operations B. Take Your Places! A. A Variety of Operations Explanation: (0,0) - > (a, b) how many steps are needed. There are only three operations (+ x,+x),(+x,-x),(-x,+x); Analysis: (0,0) - > (a, b) rUTF-8...

Posted by curby on Sun, 19 Dec 2021 09:38:32 +1030

## Codeforces round #739 (Div. 3) (supplementary question)

D. Make a Power of Two Question meaning: for a given number, there are two operations. You can choose to delete the number at any position, or add a number to the right of the number. Ask the operation for at least several times to turn the number into a power of 2 Idea: directly preprocess allUTF-8...

Posted by -twenty on Mon, 20 Dec 2021 09:21:45 +1030

## CodeForces - 1557C - Moamen and XOR

Title Link: Click to enter subject meaning of the title If the array with specified length n is satisfied a 1 a_1 a1​& a 2 a_2 a2​&... a n a_n an​ >= a 1 ⊕ a 2 ⊕ a_1 \oplus a_2 \oplus a1​⊕a2​⊕... ⊕ a n \oplus a_n ⊕ an thinks it's a victory. Each array element is less than 2 k 2^k On the premiseUTF-8...

Posted by jamessw on Thu, 30 Dec 2021 12:46:17 +1030

## Codeforces Round #531 (Div. 3) (A-E) (Summer Training 8.9)

Plane ticket Achievements and summary When we found that there was a bug in the big D simulation, we found that E could do it. We jumped to wa in the last 30 seconds and passed E 10 minutes after the race. 😦 It's too difficult to see a simpler 1700-point question A. Integer Sequence Dividing TUTF-8...

Posted by guzman-el-bueno on Thu, 30 Dec 2021 14:31:47 +1030

## Baidu Star Programming Competition 2021 - Preliminary 1

Title Link URL: Contest Problem List (hdu.edu.cn) 1001It is a question of operation on a graph. Seek the probability. When the game is unread, there will be time to supplement it later. The level of operation code on the graph decreases dramatically.1003The fourth easy topic in the whole sessioUTF-8...

Posted by wiredweb on Sun, 02 Jan 2022 04:25:27 +1030

## 2021 Baidu star &middot; programming competition - second preliminary

website: Contest Problem List (hdu.edu.cn) 1001Check in questionFor the pit points in the text, the modulus cannot be negative, resulting in the delay in AC dropping, the check-in question WA dropping 3 times, wasting many times of penalty time1002Check in questionOne time traversal, greedy solUTF-8...

Posted by stormx on Wed, 05 Jan 2022 08:53:34 +1030

## Educational codeforces round 32 - G. XOR MST (01 dictionary tree + divide and conquer)

Title Link: Click to enter subject meaning of the title Give you the value of n points. Add edges to n points to generate a tree. The edge weight is the XOR value of two points. It is required that the sum of all the final edge weights is the smallest. Output the minimum edge weight sum. thinkiUTF-8...

Posted by drag0ner on Wed, 12 Jan 2022 19:12:38 +1030

## Codeforces Round #757 (Div. 2) - codeforces supplement plan - January 12-13, 2022

Title Link A. Divan and a Store Give the unit price of n chocolates, the lowest price l, the highest price r, and the total amount of money, and find out how much you can buy at most. greedy Sort and buy from the lowest price in line with the range #include using namespace std; UTF-8...

Posted by CircularStopSign on Thu, 13 Jan 2022 16:15:53 +1030