随笔分类 - Codeforces
摘要：B. Raspberries You are given an array of integers $a_1, a_2, \ldots, a_n$ and a number $k$ ($2 \leq k \leq 5$). In one operation, you can do the follo
阅读全文
摘要：C. Medium Design The array $a_1, a_2, \ldots, a_m$ is initially filled with zeroes. You are given $n$ pairwise distinct segments $1 \le l_i \le r_i \l
阅读全文
摘要：D. Professor Higashikata Josuke is tired of his peaceful life in Morioh. Following in his nephew Jotaro's footsteps, he decides to study hard and beco
阅读全文
摘要：D. Monocarp and the Set Monocarp has $n$ numbers $1, 2, \dots, n$ and a set (initially empty). He adds his numbers to this set $n$ times in some order
阅读全文
摘要：G. Anya and the Mysterious String Anya received a string $s$ of length $n$ brought from Rome. The string $s$ consists of lowercase Latin letters and a
阅读全文
摘要：C. Decreasing String Recall that string $a$ is lexicographically smaller than string $b$ if $a$ is a prefix of $b$ (and $a \ne b$), or there exists an
阅读全文
摘要：G. ABBC or BACB You are given a string $s$ made up of characters $\texttt{A}$ and $\texttt{B}$. Initially you have no coins. You can perform two types
阅读全文
摘要：C. Card Game There are $n$ cards stacked in a deck. Initially, $a_{i}$ is written on the $i$-th card from the top. The value written on a card does no
阅读全文
摘要：D. Sum of XOR Functions You are given an array $a$ of length $n$ consisting of non-negative integers. You have to calculate the value of $\sum_{l=1}^{
阅读全文
摘要：D. Effects of Anti Pimples Chaneka has an array $[a_1,a_2,\ldots,a_n]$. Initially, all elements are white. Chaneka will choose one or more different i
阅读全文
摘要：D. Prefix Purchase You have an array $a$ of size $n$, initially filled with zeros ($a_1 = a_2 = \ldots = a_n = 0$). You also have an array of integers
阅读全文
摘要：D1. Candy Party (Easy Version) This is the easy version of the problem. The only difference is that in this version everyone must give candies to exac
阅读全文
摘要：F. Selling a Menagerie You are the owner of a menagerie consisting of $n$ animals numbered from $1$ to $n$. However, maintaining the menagerie is quit
阅读全文
摘要：D. Balanced String You are given a binary string $s$ (a binary string is a string consisting of characters 0 and/or 1). Let's call a binary string bal
阅读全文
摘要：F1. Omsk Metro (simple version) This is the simple version of the problem. The only difference between the simple and hard versions is that in this ve
阅读全文
摘要：D. Sorting By Multiplication You are given an array $a$ of length $n$, consisting of positive integers. You can perform the following operation on thi
阅读全文
摘要：C. Vika and Price Tags Vika came to her favorite cosmetics store "Golden Pear". She noticed that the prices of $n$ items have changed since her last v
阅读全文
摘要：D. Imbalanced Arrays Ntarsis has come up with an array $a$ of $n$ non-negative integers. Call an array $b$ of $n$ integers imbalanced if it satisfies
阅读全文
摘要：C. MEX Repetition You are given an array $a_1,a_2,\ldots, a_n$ of pairwise distinct integers from $0$ to $n$. Consider the following operation: consec
阅读全文
摘要：B. Split Sort You are given a permutation$^{\dagger}$ $p_1, p_2, \ldots, p_n$ of integers $1$ to $n$. You can change the current permutation by applyi
阅读全文
浙公网安备 33010602011771号