摘要:
F - Subsequence LCM Problem Statement You are given a sequence of positive integers $A=(A_1,A_2,\dots,A_N)$ of length $N$ and a positive integer $M$. 阅读全文
摘要:
H. The Most Reckless Defense You are playing a very popular Tower Defense game called "Runnerfield 2". In this game, the player sets up defensive towe 阅读全文
摘要:
G. GCD on a grid Not long ago, Egor learned about the Euclidean algorithm for finding the greatest common divisor of two numbers. The greatest common 阅读全文
摘要:
D. Colored Balls There are balls of $n$ different colors; the number of balls of the $i$-th color is $a_i$. The balls can be combined into groups. Eac 阅读全文
摘要:
D. Buying Jewels Alice has $n$ coins and wants to shop at Bob's jewelry store. Today, although Bob has not set up the store yet, Bob wants to make sur 阅读全文
摘要:
C. Ticket Hoarding As the CEO of a startup company, you want to reward each of your $k$ employees with a ticket to the upcoming concert. The tickets w 阅读全文
摘要:
F. New Year Tree You are a programmer and you have a New Year Tree (not the traditional fur tree, though) — a tree of four vertices: one vertex of deg 阅读全文
摘要:
F - Oddly Similar Problem Statement There are $N$ sequences of length $M$, denoted as $A_1, A_2, \ldots, A_N$. The $i$-th sequence is represented by $ 阅读全文
摘要:
D. Non-Palindromic Substring A string $t$ is said to be $k$-good if there exists at least one substring$^\dagger$ of length $k$ which is not a palindr 阅读全文