随笔分类 - Codeforces
摘要:A. Bestie You are given an array $a$ consisting of $n$ integers $a_1,a_2, \dots ,a_n$. Friends asked you to make the greatest common divisor (GCD) of
阅读全文
摘要:D. Problem with Random Tests You are given a string $s$ consisting of $n$ characters. Each character of $s$ is either $0$ or $1$. A substring of $s$ i
阅读全文
摘要:C. Save the Magazines Monocarp has been collecting rare magazines for quite a while, and now he has decided to sell them. He distributed the magazines
阅读全文
摘要:E2. Divisible Numbers (hard version) This is an hard version of the problem. The only difference between an easy and a hard version is the constraints
阅读全文
摘要:E1. Divisible Numbers (easy version) This is an easy version of the problem. The only difference between an easy and a hard version is the constraints
阅读全文
摘要:F. Multi-Colored Segments Dmitry has $n$ segments of different colors on the coordinate axis $Ox$. Each segment is characterized by three integers $l_
阅读全文
摘要:E. Sending a Sequence Over the Network The sequence $a$ is sent over the network as follows: sequence $a$ is split into segments (each element of the
阅读全文
摘要:D. Equal Binary Subsequences Everool has a binary string $s$ of length $2n$. Note that a binary string is a string consisting of only characters $0$ a
阅读全文
摘要:C1. Good Subarrays (Easy Version) This is the easy version of this problem. In this version, we do not have queries. Note that we have multiple test c
阅读全文
摘要:B. Playing with GCD You are given an integer array $a$ of length $n$. Does there exist an array $b$ consisting of $n+1$ positive integers such that $a
阅读全文

浙公网安备 33010602011771号