Adam Gąsienica‑Samek Contest 1

12 problems from Adam Gąsienica‑Samek Contest 1 (contest 104479), difficulty -. 12/12 solutions verified against sample I/O.

12 items

Adam Gąsienica‑Samek Contest 1

Special | 12 problems | 12/12 verified | Difficulty - | 14m 29s

# Problem Rating Tags Accepted Time ✓
A Assembly 1m ✓
B Beautiful XOR Problem 1m 8s ✓
C Convolution 1m 18s ✓
D DAG Probability 58s ✓
E Erase the Primes 1m 20s ✓
F Forest Game 1m 5s ✓
G Guessing by Divisibility 53s ✓
H Highest Median Walk 1m 21s ✓
I Incomplete Information Queries 59s ✓
J Joining Arrays 1m 12s ✓
K Kid's First Geometry Problem 1m 18s ✓
L Lying Faces 1m 57s ✓
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479L - Lying Faces

We are given a directed graph where each edge has a weight, and we are allowed to walk through the graph by following directed edges. A walk can reuse vertices and edges.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479K - Kid's First Geometry Problem

We are given one fixed convex polygon A and multiple other convex polygons B₁ through Bₖ. Initially, every Bi overlaps the interior of A in a strong sense, meaning they are not merely touching but have a positive-area intersection.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479J - Joining Arrays

We are given a collection of sets, one set per position in an array. From each set, we must pick exactly one number, producing a final array $A$. Once the array is fixed, we compute a derived object called its permutation scaling.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479H - Highest Median Walk

We are given a directed graph where each edge has a weight, and we are allowed to walk through the graph by following directed edges. A walk can reuse vertices and edges.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479I - Incomplete Information Queries

We are dealing with a tournament-style directed graph. Between every pair of distinct vertices, there is exactly one directed edge, so for any pair $x, y$, either $x to y$ or $y to x$, but never both.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479G - Guessing by Divisibility

We are dealing with a hidden integer $n$ that is fixed at the start and lies somewhere between 1 and 10,000. The only way to obtain information about it is by asking divisibility questions of the form “is $n$ divisible by $x$?”, where $x$ is any integer from 1 to 10,000.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479E - Erase the Primes

We are given a sequence of integers, and we are allowed to repeatedly merge any two chosen elements by removing them and inserting their product back into the sequence.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479F - Forest Game

We are maintaining a forest that grows over time. Initially there are n isolated vertices. Each update of type 1 connects two previously disconnected vertices, so every component always stays a tree. On top of this evolving forest, we repeatedly play a probabilistic game query.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479D - DAG Probability

We are building a directed complete graph on vertices labeled from 1 to n. For every pair of vertices u and v, exactly one directed edge is created between them.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479C - Convolution

We are given two sequences, and we define a new sequence that behaves like a convolution: each position k in the result is formed by summing all products of pairs of elements whose indices add up to k.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479B - Beautiful XOR Problem

We are given a list of numbers and asked to count how many of its subsequences satisfy two conditions at the same time. First, if we take all chosen elements and XOR them together, the result must be zero.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Adam Gąsienica‑Samek Contest 1 ›

CF 104479A - Assembly

We are asked to produce a program written in a simplified assembly language. That program will later be executed by a machine that has four integer registers named A, B, C, and D, all starting at zero.
codeforces competitive-programming Jun 30, 2026