CPG Training Contest - 1

6 problems from CPG Training Contest - 1 (contest 105227), difficulty -. 1/6 solutions verified against sample I/O.

6 items

CPG Training Contest - 1

Special | 6 problems | 1/6 verified | Difficulty - | 15m 32s

#	Problem	Time	✓
A	LLPS	5m 15s
B	Let's Watch Football	1m 6s	✓
C	Card Constructions	5m 14s
D	Chat Order	1m 13s
E	Recursive Queries	1m 30s
F	k-Amazing Numbers	1m 14s

Practice › Codeforces Solutions › CPG Training Contest - 1 ›

CF 105227A - LLPS

We are given a single string made of lowercase letters. From this string we may delete characters while preserving order, producing any subsequence.

Practice › Codeforces Solutions › CPG Training Contest - 1 ›

CF 105227C - Card Constructions

We are given a number of cards and asked to repeatedly construct the tallest possible “card pyramid”, remove the cards used, and continue until no further pyramid can be built. The final answer is how many pyramids were constructed across all iterations.

Practice › Codeforces Solutions › CPG Training Contest - 1 ›

CF 105227F - k-Amazing Numbers

We are given an array and we want to understand how “stable” each value is across fixed-length windows. For a chosen window size $k$, we slide a segment of length $k$ across the array. A number is considered good for this $k$ if it appears in every single such segment.

Practice › Codeforces Solutions › CPG Training Contest - 1 ›

CF 105227E - Recursive Queries

Each query gives a segment of integers and asks how many numbers in that segment share a specific value under a transformation function g. The function g takes a number and repeatedly replaces it with the product of its digits until the value becomes a single digit.

Practice › Codeforces Solutions › CPG Training Contest - 1 ›

CF 105227D - Chat Order

We are simulating a dynamic chat sidebar that always shows recent conversations first. Every time Polycarp sends a message to a friend, that friend’s chat becomes the most recently active and is moved to the very top of the list.

Practice › Codeforces Solutions › CPG Training Contest - 1 ›

CF 105227B - Let's Watch Football

We are given a video of length c seconds. Each second of watching requires consuming a units of data, while the internet connection can download b units of data per second continuously.