上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 53 下一页
摘要: G. Mischievous Shooter Once the mischievous and wayward shooter named Shel found himself on a rectangular field of size $n \times m$, divided into uni 阅读全文
posted @ 2024-01-24 21:46 onlyblues 阅读(36) 评论(0) 推荐(0) 编辑
摘要: F1. Smooth Sailing (Easy Version) The only difference between the two versions of this problem is the constraint on $q$. You can make hacks only if bo 阅读全文
posted @ 2024-01-23 18:53 onlyblues 阅读(7) 评论(0) 推荐(0) 编辑
摘要: B - Arithmetic Progression Subsequence Problem Statement You are given a sequence $A$ of length $N$ consisting of integers between $1$ and $\textbf{10 阅读全文
posted @ 2024-01-22 18:50 onlyblues 阅读(27) 评论(0) 推荐(0) 编辑
摘要: F - Usual Color Ball Problems Problem Statement You are given positive integers $N$, $M$, $K$, and a sequence of positive integers of length $N$, $(C_ 阅读全文
posted @ 2024-01-21 19:00 onlyblues 阅读(49) 评论(0) 推荐(0) 编辑
摘要: D. Array Repetition Jayden has an array $a$ which is initially empty. There are $n$ operations of two types he must perform in the given order. Jayden 阅读全文
posted @ 2024-01-19 21:17 onlyblues 阅读(4) 评论(0) 推荐(0) 编辑
摘要: F - Hop Sugoroku Problem Statement There is a row of $N$ squares labeled $1,2,\dots,N$ and a sequence $A=(A_1,A_2,\dots,A_N)$ of length $N$.Initially, 阅读全文
posted @ 2024-01-17 19:30 onlyblues 阅读(9) 评论(0) 推荐(0) 编辑
摘要: F. Sum of Progression You are given an array $a$ of $n$ numbers. There are also $q$ queries of the form $s, d, k$. For each query $q$, find the sum of 阅读全文
posted @ 2024-01-16 23:48 onlyblues 阅读(57) 评论(0) 推荐(0) 编辑
摘要: E. Happy Life in University Egor and his friend Arseniy are finishing school this year and will soon enter university. And since they are very respons 阅读全文
posted @ 2024-01-14 00:59 onlyblues 阅读(3) 评论(0) 推荐(0) 编辑
摘要: 制作地图 贝茜正在学习制作扫雷地图。 作为初学者,它打算先从简单的一维地图做起,它准备制作一张 $1 \times n$ 大小的地图(即 $1 \times n$ 的方格矩阵)。 地图中含有地雷的方格,应标记为 *;不含地雷的方格,应标记为一个 $0$ 到 $2$ 之间的数字,用来表示其相邻方格中的 阅读全文
posted @ 2024-01-12 18:33 onlyblues 阅读(8) 评论(0) 推荐(0) 编辑
摘要: 重新分装 有 $n$ 种零件,编号 $1 \sim n$。 第 $i$ 种零件的数量为 $a_i$。 有 $n$ 个箱子,编号 $1 \sim n$。 初始时,所有零件都装在第 $1$ 个箱子里。 我们希望将所有零件重新分装,使得最终对于每个 $i$($1 \le i \le n$)都满足,所有的第 阅读全文
posted @ 2024-01-11 22:24 onlyblues 阅读(2) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 53 下一页
Web Analytics