摘要:
G2. Yunli's Subarray Queries (hard version) This is the hard version of the problem. In this version, it is guaranteed that $r \geq l+k-1$ for all que 阅读全文
摘要:
H. Sakurako's Test Sakurako will soon take a test. The test can be described as an array of integers $n$ and a task on it: Given an integer $x$, Sakur 阅读全文
摘要:
D2. Turtle and a MEX Problem (Hard Version) The two versions are different problems. In this version of the problem, you can't choose the same integer 阅读全文
摘要:
E - Permute K times Problem Statement You are given a sequence $X$ of length $N$ where each element is between $1$ and $N$, inclusive, and a sequence 阅读全文
摘要:
E. Not a Nim Problem Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with the $i$-th pile initially containing $a_i$ st 阅读全文
摘要:
H. Ksyusha and the Loaded Set Ksyusha decided to start a game development company. To stand out among competitors and achieve success, she decided to 阅读全文
摘要:
G - AtCoder Office Problem Statement $N$ people work at the AtCoder office. The office keeps records of entries and exits, and there have been $M$ ent 阅读全文