上一页 1 ··· 19 20 21 22 23 24 25 26 27 ··· 63 下一页
摘要: D. Doremy's Connecting Plan Doremy lives in a country consisting of $n$ cities numbered from $1$ to $n$, with $a_i$ people living in the $i$-th city. 阅读全文
posted @ 2023-10-29 19:37 onlyblues 阅读(71) 评论(1) 推荐(0)
摘要: E. Segment Sum You are given two integers $l$ and $r$ ($l \le r$). Your task is to calculate the sum of numbers from $l$ to $r$ (including $l$ and $r$ 阅读全文
posted @ 2023-10-25 20:47 onlyblues 阅读(73) 评论(0) 推荐(0)
摘要: E. Time Travel Berland is a country with ancient history, where roads were built and destroyed for centuries. It is known that there always were $n$ c 阅读全文
posted @ 2023-10-24 18:40 onlyblues 阅读(108) 评论(0) 推荐(0)
摘要: Minimum Changes to Make K Semi-palindromes Given a string s and an integer k, partition s into k substrings such that the sum of the number of letter 阅读全文
posted @ 2023-10-24 16:16 onlyblues 阅读(38) 评论(0) 推荐(0)
摘要: D2. Dances (Hard Version) This is the hard version of the problem. The only difference is that in this version $m \leq 10^9$. You are given two arrays 阅读全文
posted @ 2023-10-23 23:56 onlyblues 阅读(79) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2023-10-23 19:34 onlyblues 阅读(26) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2023-10-23 17:28 onlyblues 阅读(189) 评论(0) 推荐(0)
摘要: koishi的数学题 题目描述 Koishi 在 Flandre 的指导下成为了一名数学大师,她想了一道简单的数学题。 输入一个整数 $n$,设 $\displaystyle f(x) = \sum_{i=1}^n x \bmod i$,你需要输出 $f(1), f(2), \ldots , f(n 阅读全文
posted @ 2023-10-21 14:21 onlyblues 阅读(25) 评论(0) 推荐(0)
摘要: 统计子矩阵 给定一个 $N \times M$ 的矩阵 $A$,请你统计有多少个子矩阵 (最小 $1 \times 1$,最大 $N × M$) 满足子矩阵中所有数的和不超过给定的整数 $K$? 输入格式 第一行包含三个整数 $N, M$ 和 $K$。 之后 $N$ 行每行包含 $M$ 个整数,代表 阅读全文
posted @ 2023-10-20 10:04 onlyblues 阅读(88) 评论(0) 推荐(0)
摘要: [COCI2021-2022#6] Zemljište 题目描述 有一块地,大小为 $r \times s$,$\rm Matej$ 想买下它。这块地每个 $1\times1$ 的正方形都有不同的价格。 设一片非空子矩阵价格总和为 $m$,则这片子矩阵的权值为 $|m-a|+|m-b|$,您需要找到 阅读全文
posted @ 2023-10-20 09:26 onlyblues 阅读(36) 评论(0) 推荐(0)
上一页 1 ··· 19 20 21 22 23 24 25 26 27 ··· 63 下一页
Web Analytics