2015 ACM-ICPC Asia EC-Final Contest

13 problems from 2015 ACM-ICPC Asia EC-Final Contest (contest 103957), difficulty -. 10/13 solutions verified against sample I/O.

13 items

2015 ACM-ICPC Asia EC-Final Contest

ICPC/IOI | 13 problems | 10/13 verified | Difficulty - | 14m 7s

# Problem Rating Tags Accepted Time ✓
A Boxes and Balls 43s ✓
B Business Cycle 56s ✓
C Suffixes and Palindromes 2m 5s
D Change 46s ✓
E Colorful Floor 50s ✓
F Hungry Game of Ants 46s ✓
G Legacy of the Void 2m 1s
H Open Face Chinese Poker 54s ✓
I Champions League 49s ✓
J Dome and Steles 52s ✓
K Convex Polyhedron 50s ✓
L Multiplication Table 47s ✓
M November 11th 1m 48s
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957M - November 11th

A truth table of order $n$ is a binary string of length $2^n$. A bead is a truth table $beta$ that is not of the form $alphaalpha$. A Boolean function is sweet if every subtable obtained by fixing any prefix of variables is a bead.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957L - Multiplication Table

We are given a grid of size $R times C$ where each cell contains either a known integer or a missing value represented by a question mark.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957K - Convex Polyhedron

We are given the coordinates of all vertices of a convex polyhedron in three-dimensional space. We are allowed to rotate this solid arbitrarily in 3D, then “shine a light” from a fixed direction and look at the orthogonal projection of the polyhedron onto a plane.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957G - Legacy of the Void

A truth table of order $n$ is a binary string of length $2^n$. A bead is a truth table $beta$ that is not of the form $alphaalpha$. A Boolean function is sweet if every subtable obtained by fixing any prefix of variables is a bead.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957J - Dome and Steles

Each test case gives a collection of identical vertical blocks, where every block is a cuboid with one fixed dimension equal to 1 and two other dimensions $ai$ and $bi$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957I - Champions League

We are simulating a constrained random assignment process for 32 football teams. The teams are already divided into four fixed tiers, each tier containing exactly eight teams.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957H - Open Face Chinese Poker

We are given 14 distinct playing cards. From these, we must discard exactly one card and then split the remaining 13 cards into three poker hands: a 3-card front hand, a 5-card middle hand, and a 5-card back hand.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957E - Colorful Floor

We are building a periodic tiling of an $R times C$ rectangle, and then repeating it infinitely in both directions. So the entire plane is determined by a finite matrix of size $R times C$, where each cell is assigned one of $K$ colors.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957F - Hungry Game of Ants

We are given a line of ants placed at integer positions from 1 to N. Ant i starts exactly at position i and has weight i. At time zero each ant independently chooses a direction, left or right, with equal probability. All ants then move at the same constant speed.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957C - Suffixes and Palindromes

A truth table of order $n$ is a binary string of length $2^n$. A bead is a truth table $beta$ that is not of the form $alphaalpha$. A Boolean function is sweet if every subtable obtained by fixing any prefix of variables is a bead.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957D - Change

We start with a single banknote of value $A$, and we want to end up with the ability to pay exactly $B$, where $A B$. The only tool available is a vending machine: we spend some amount of money on goods, and the machine gives back change.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957B - Business Cycle

We are given a cyclic sequence of phases, each phase adding some value to our current amount of money. The twist is that money is never allowed to go below zero, if an operation would make it negative, it is clamped back to zero instead.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2015 ACM-ICPC Asia EC-Final Contest ›

CF 103957A - Boxes and Balls

We start with a collection of boxes, each box containing some number of balls. One operation modifies this configuration in a very specific way.
codeforces competitive-programming Jul 2, 2026