SashaT9 Contest 1

8 problems from SashaT9 Contest 1 (contest 104536), difficulty -. 4/8 solutions verified against sample I/O.

8 items

SashaT9 Contest 1

Special | 8 problems | 4/8 verified | Difficulty - | 13m 23s

# Problem Rating Tags Accepted Time ✓
A XOR Permutation 1m 30s ✓
B Maximize the Mean 1m 8s ✓
C Maximum GCD Subsequences 1m 41s ✓
D Make Them Equal 1m 44s
E LIS Maximization 3m 18s
F Minimize the Diameter 1m 38s ✓
G Count the Pairs 28s
H Sort Permutation 1m 56s
Practice › Codeforces Solutions › SashaT9 Contest 1 ›

CF 104536E - LIS Maximization

The failure is not coming from the tree logic itself but from the testing harness behavior in the provided solution. The key symptom is this line: and the fact that the output is an empty string inside the test runner rather than the computed value.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › SashaT9 Contest 1 ›

CF 104536H - Sort Permutation

We are given a permutation of size $n$, and the only way we are allowed to modify it is by taking a contiguous segment and sorting that segment in increasing order. Each such operation has a cost equal to the sum of values currently inside that segment at the moment we apply it.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › SashaT9 Contest 1 ›

CF 104536D - Make Them Equal

We are given a string where each position holds a lowercase letter. The only allowed move picks one letter, finds all positions currently containing that letter, and increments all of them to the next letter in cyclic order, meaning a → b → ... → z → a.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › SashaT9 Contest 1 ›

CF 104536G - Count the Pairs

Something went wrong while generating the response. If this issue persists please contact us through our help center at [help.openai.com](https://help.openai.com/).
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › SashaT9 Contest 1 ›

CF 104536F - Minimize the Diameter

We are given two independent trees, each already connected internally. We are allowed to add exactly one new edge between a vertex of the first tree and a vertex of the second tree.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › SashaT9 Contest 1 ›

CF 104536C - Maximum GCD Subsequences

We are given an array of integers and asked to compute a derived value for every possible subsequence length k. For a fixed k, we look at all subsequences of size k and consider the greatest common divisor of the chosen elements.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › SashaT9 Contest 1 ›

CF 104536A - XOR Permutation

We are given a positive integer $n$, and we want to understand whether there exists a value $x$ such that when we XOR every number from $1$ to $n$ with $x$, the resulting sequence is exactly a permutation of the numbers $1$ through $n$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › SashaT9 Contest 1 ›

CF 104536B - Maximize the Mean

We are given a square grid of real-valued transformation power. In one operation, we pick a single row or a single column and replace every entry in that line with its arithmetic mean before the operation.
codeforces competitive-programming Jun 30, 2026