## LeeCode 190. Reverse binary

190. Reverse binary Simple difficulty Inverts the binary bits of a given 32-bit unsigned integer. Tips: Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be specified as signed integer types and should not affect your implementation, because the internal binary representat ...

Posted by networkguy on Fri, 25 Feb 2022 08:38:30 +0100

## [Codeforces] the abundance of Codeforces [partial explanation]

Abundance of Codeforces [by_041] Codeforces Round #721 (Div. 2) Codeforces Round #721 (Div. 2) A. And Then There Were K Problem - A - Codeforces The meaning of the question is to seek satisfaction[ n & ( n ...

Posted by tready29483 on Tue, 08 Feb 2022 07:54:43 +0100

## Explanation of the third session of 2022 Niuke winter camp

Question A Zhinai's Hello XXXX (sign in) Output \ (\ text{hello xxx} \), where xxx can be any string Just output whatever you want to sign in, but it's still recommended to follow a string composed of ASCII code to prevent random code. print("hello world") Question B Wisdom is buying melons (01 backpack) Now there are \ (n \) melons, and th ...

Posted by andrewmcgibbon on Fri, 04 Feb 2022 15:23:44 +0100

## Supplementary questions of TIANTI competition of Shanghai University of Technology

Meaning of question A Give you a string and let you calculate how many pairs of adjacent letters there are, For example, a and b, b and c are two pairs of adjacent letters, while a and c, a and z are not. (Note: the letters on any two subscripts can become adjacent pairs. For example, for the string "adfb", the character 'a' with sub ...

Posted by dukeu03 on Sat, 29 Jan 2022 10:31:15 +0100

## Codeforces Round #767 (Div. 2) (Updated)

title : Codeforces Round #767 (Div. 2) date : 2022-1-23 Tags: ACM, practice notes author : Linno Title link: https://codeforces.com/contest/1629 Test progress: 4/7 A-Download More RAM Give you the initial memory capacity k and n expansion packs. If your current memory is larger than the expansion pack's requirement ai, you can increase th ...

Posted by bidntrade on Sun, 23 Jan 2022 03:08:18 +0100

## CF Round 764 Div3 problem solution

Question A Plus One on the Subset (sign in) There are \ (T(1\leq T \leq 10^4) \) groups of data. Given an array \ (\ {a_n \} \) with a length of \ (n \), you can perform multiple operations. In each operation, you can add 1 to the value of any element. How many operations are required at least to make the values of all numbers in the array the ...

Posted by AwptiK on Thu, 13 Jan 2022 17:01:22 +0100

## [Codeforces]Hello 2022(A-C) problem solution

Better reading experience: http://www.abmcar.top/archives/codeforceshello2022 Complete source code: https://github.com/abmcar/ACM/tree/master/OpenjudgeNow/Codeforces/Hello%202022 Tip from the front row: the questions in this field are very disgusting and are not recommended A. Stable Arrangement of Rooks Main idea of the topic: give you a bo ...

Posted by JackSevelle on Thu, 06 Jan 2022 15:20:18 +0100

## Good Bye 2021: 2022 is NEAR (A-D)

Full code: https://github.com/abmcar/ACM/tree/master/OpenjudgeNow/Codeforces/Good%20Bye%202021-2022%20is%20NEAR Better reading experience: http://www.abmcar.top/archives/goodbye20212022isneara-d-ti-jie A. Integer Diversity Give you n numbers, you can choose any number to multiply by - 1, and ask how many different numbers you can get at mos ...

Posted by Waire on Mon, 03 Jan 2022 06:03:52 +0100

## AC automata (virus invasion ongoing)

This question is also a board question, which is very similar to the previous question, that is, multiple counting and storage. It was explained in detail in the previous blog post. Then this question talked about maxn. It must be + 5 / + 10 when taking the size of the array, especially when manually assigning the size, such as ans[1000], it is ...

Posted by JC99 on Thu, 30 Dec 2021 19:19:19 +0100

## Network flow - bipartite graph matching - pilot pairing scheme problem - network flow question 24 - Luogu P2756

Network flow - bipartite graph matching - pilot pairing scheme problem - network flow question 24 - Luogu P2756 Title Description There are n pilots in total, including M foreign pilots and (n - m) British pilots. Foreign pilots are numbered from 1 to m and British pilots are numbered from m + 1 to n. For a given cooperation between foreign p ...

Posted by daven on Fri, 24 Dec 2021 17:14:17 +0100