The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest

13 problems from The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest (contest 102835), difficulty -. 11/13 solutions verified against sample I/O.

13 items

The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest

ICPC/IOI | 13 problems | 11/13 verified | Difficulty - | 10m 28s

#	Problem	Time	✓
A	Right-Coupled Numbers	36s	✓
B	Make Numbers	56s	✓
C	Pyramid	49s	✓
D	Quality Monitoring	27s
E	A Color Game	42s	✓
F	Cable Protection	39s	✓
G	Graph Cards	41s	✓
H	Optimization for UltraNet	1m 3s	✓
I	Critical Structures	1m 10s	✓
J	Puzzle Game	44s	✓
K	Number with Bachelors	52s	✓
L	Save lives or money	43s
M	Keystroke	1m 6s	✓

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835C - Pyramid

The problem models a triangular pyramid of switches. There are n rows of nodes. A sequence of balls enters the top of the pyramid one by one. Every node has a switch that alternates its direction after each ball passes through it.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835B - Make Numbers

The task is to take four given digits and create as many different non-negative integers as possible. Each valid expression must use all four digits exactly once.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835M - Keystroke

The problem models a faulty numeric keypad with four keys arranged as a 2 by 2 grid. Each key corresponds to one of the numbers 1 to 4, and pressing a key produces a pair containing its row index and column index.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835L - Save lives or money

I can write the full editorial, but I need the actual problem statement or constraints first. Codeforces 102835L’s statement is not included in your prompt, and the title alone is not enough to reconstruct the required algorithm reliably.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835K - Number with Bachelors

A bachelor number is a number whose representation in a chosen base contains no repeated digit. The problem supports two bases: decimal and hexadecimal. For example, 123 is a bachelor number in base 10, while 9af is a bachelor number in base 16.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835J - Puzzle Game

The puzzle is a circular disk with n sectors. The arrow starts at sector s, and every button press moves it exactly k sectors clockwise. The sectors wrap around, so after sector n - 1 the next sector is 0.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835I - Critical Structures

The input describes a communication network. Each vertex is a computing node and each edge is a communication link between two nodes. A critical node is a vertex whose removal makes the network disconnected. A critical link is an edge whose removal disconnects the network.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835H - Optimization for UltraNet

The network is an undirected weighted graph where cities are vertices and cables are edges. Each cable has a bandwidth value. The company wants to remove cables while keeping every city reachable from every other city, so the final network must be a spanning tree.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835G - Graph Cards

The input describes a deck of graph cards. Each card contains an undirected simple graph. A card is valid because the graph has the same number of vertices and edges and is connected, which means every card represents a connected unicyclic graph: a tree with exactly one…

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835F - Cable Protection

The network has a single circular backbone. Every backbone switch can have a tree shaped subnet attached to it, so the whole graph contains exactly one cycle and all other edges belong to trees hanging from that cycle.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835E - A Color Game

We have a string of colored tiles. There are seven possible colors. An operation can remove a group of tiles if we can choose a subsequence consisting of tiles of only one color and the size of that subsequence is larger than a given threshold.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835D - Quality Monitoring

I can write the full editorial, but the problem statement details are missing. I could not reliably identify the exact task from only “Codeforces 102835D - Quality Monitoring”, and I do not want to invent an algorithm, examples, or code for the wrong problem.

Practice › Codeforces Solutions › The 2020 ICPC Asia Taipei-Hsinchu Site Programming Contest ›

CF 102835A - Right-Coupled Numbers

We need decide whether a given positive integer can be split into two factors that are close enough in size. A number x is considered right-coupled if there exist two positive integers a and b where a is the smaller factor, b is the larger factor, their product is exactly x…