摘要:
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 阅读全文
摘要:
Count Subarrays With Fixed Bounds You are given an integer array nums and two integers minK and maxK . A fixed-bound subarray of nums is a subarray th 阅读全文
摘要:
Minimize Maximum of Array You are given a 0-indexed array nums comprising of $n$ non-negative integers. In one operation, you must: Choose an integer 阅读全文
摘要:
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 阅读全文