onlyblues

摘要： D1. Balance (Easy version) This is the easy version of the problem. The only difference is that in this version there are no "remove" queries. Initial 阅读全文

摘要： B. Ugu A binary string is a string consisting only of the characters $0$ and $1$. You are given a binary string $s_1 s_2 \dots s_n$. It is necessary t 阅读全文

摘要： 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 阅读全文

摘要： 三元组 给定 $n$ 个两两不同的正整数 $a_1,a_2, \dots ,a_n$。 请你计算共有多少个三元组 $(i,j,k)$ 能够同时满足： $i<j<k$ $a_i>a_j>a_k$ 输入格式 第一行包含整数 $n$。 第二行包含 $n$ 个整数 $a_1,a_2, \dots ,a_n$ 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文