2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams)
14 problems from 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) (contest 2172), difficulty 800-3300. 5/14 solutions verified against sample I/O.
2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams)
ICPC/IOI | 14 problems | 5/14 verified | Difficulty 800-3300 | 31m 43s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | ASCII Art Contest | 800 | implementation | 14,501 | 2m 54s | ✓ |
| B | Buses | 1800 | greedy, sortings | 2,132 | 3m 42s | |
| C | Circles Are Far from Each Other | 3100 | binary-search, greedy | 95 | 1m 48s | |
| D | Divisor Card Game | 3100 | combinatorics, dp | 103 | 2m 14s | |
| E | Number Maze | 1200 | implementation | 5,890 | 2m 53s | ✓ |
| F | Cluster Computing System | 1600 | graphs, greedy, math | 3,884 | 1m 36s | ✓ |
| G | Gene Editor | 3300 | 66 | 2m 1s | ||
| H | Shuffling Cards with Problem Solver 68! | 2500 | hashing, string-suffix-structures, strings | 302 | 2m 18s | ✓ |
| I | Birthday | 2000 | geometry | 1,078 | 3m 30s | |
| J | Sliding Tiles | 2300 | data-structures, divide-and-conquer, dsu | 561 | 1m 46s | |
| K | Kindergarten Homework | 2100 | implementation, strings | 842 | 37s | |
| L | Maximum Color Segment | 2300 | dp, implementation | 801 | 1m 37s | |
| M | Maximum Distance To Port | 1300 | graphs, shortest-paths | 5,808 | 1m 17s | ✓ |
| N | New Kingdom | 2800 | constructive-algorithms, graphs, implementation | 163 | 3m 30s |
CF 2172N - New Kingdom
We are asked to construct an undirected simple connected graph on $n$ labeled vertices. The graph must satisfy three structural constraints at the same time. First, it must be a single connected component without multi-edges or self-loops.
CF 2172M - Maximum Distance To Port
We have a network of cities connected by roads, where each road is exactly one kilometer long. Each city produces one type of agricultural product, and city 1 is a central port.
CF 2172L - Maximum Color Segment
We have a rope consisting of n units, each colored either red or black. The rope is represented as a string of length n where each character is R or B. We are allowed to perform up to m operations.
CF 2172I - Birthday
We are asked to cut a circular cake, represented as a circle centered at the origin with radius r, into two pieces using a single straight line. On the cake are n strawberries, each strictly within 0.9 times the radius from the center.
CF 2172K - Kindergarten Homework
Error in message stream
CF 2172J - Sliding Tiles
We are given an $n times n$ grid with tiles stacked in columns and vertical bars between adjacent columns. Each column $i$ starts with $ai$ tiles stacked from the bottom.
CF 2172H - Shuffling Cards with Problem Solver 68!
We are given a deck of $2^k$ cards represented as a string of lowercase letters. The deck can be rotated by moving the first $m$ cards to the end. After this optional rotation, the deck is riffle-shuffled $t$ times.
CF 2172G - Gene Editor
We are asked to count how many gene sequences of a given length can be obtained from an initial sequence using a specific set of mutations. The sequences only contain A and B, and mutations allow inserting or deleting AA, BBB, or a special substring s.
CF 2172E - Number Maze
We are given a very small “number universe” built from the digits of a base number. The base number is always one of three possibilities: a two-digit number, a three-digit number, or a four-digit number.
CF 2172F - Cluster Computing System
We are given a sequence of $n$ servers, each with a database protocol type $pi$, which is a positive integer. Initially, the servers are disconnected.
CF 2172D - Divisor Card Game
We are asked to model a probabilistic card game where each student starts with a subset of numbered cards and additional cards are revealed one by one.
CF 2172B - Buses
Every bus moves along the road at the same speed x. Bus i starts at position si at time 0, moves to the right, and disappears once it reaches ti. A person starts at position p. They can walk at speed y, where y < x.
CF 2172A - ASCII Art Contest
We are given the scores of three AI-powered creative assistants-Gemini, ChatGPT, and Claude-in an ASCII art contest. Each score is an integer between 80 and 100. The organizers want to decide if the judges' scores are consistent enough to announce a final result.
CF 2172C - Circles Are Far from Each Other
We are asked to place a sequence of circles on a single straight line of centers, while controlling how they may overlap and nest inside each other. Each circle has a fixed radius, and the radii are given in non-increasing order.