2021 ICPC Asia Taiwan Online Programming Contest

10 problems from 2021 ICPC Asia Taiwan Online Programming Contest (contest 103373), difficulty -. 8/10 solutions verified against sample I/O.

10 items

2021 ICPC Asia Taiwan Online Programming Contest

ICPC/IOI | 10 problems | 8/10 verified | Difficulty - | 12m 10s

#	Problem	Time	✓
A	Olympic Ranking	47s	✓
B	Aliquot Sum	47s	✓
C	A Sorting Problem	2m 34s
D	Drunk Passenger	45s	✓
E	Eatcoin	52s	✓
F	Flip	54s	✓
G	Garden Park	1m 12s	✓
H	A Hard Problem	1m 9s	✓
I	ICPC Kingdom	2m 28s
J	JavaScript	42s	✓

Practice › Codeforces Solutions › 2021 ICPC Asia Taiwan Online Programming Contest ›

CF 103373I - ICPC Kingdom

Let $C(n,t,m)$ denote the graph whose vertices are all $t$-combinations $ctldots c1$ with $$nctcdotsc1ge 0,qquad ct-c1<m,$$ and in which two vertices are adjacent when they differ in exactly one entry, that is, one replacement $cj leftarrow cj'$ preserves strict increase and…

Practice › Codeforces Solutions › 2021 ICPC Asia Taiwan Online Programming Contest ›

CF 103373H - A Hard Problem

We are given an undirected graph where each node carries a 16-bit integer value. Every edge contributes a cost equal to the Hamming distance between the two endpoint values, meaning the number of bit positions where the two node values differ.

Practice › Codeforces Solutions › 2021 ICPC Asia Taiwan Online Programming Contest ›

CF 103373J - JavaScript

We are given two short strings, x and y, and we are asked to evaluate the expression x - y exactly as JavaScript would. The key difficulty is that JavaScript does not treat all strings as strings during arithmetic.

Practice › Codeforces Solutions › 2021 ICPC Asia Taiwan Online Programming Contest ›

CF 103373G - Garden Park

We are given a connected network of $n$ locations joined by $n-1$ trails, so the structure is a tree. Each trail connects two locations and carries an integer label.

Practice › Codeforces Solutions › 2021 ICPC Asia Taiwan Online Programming Contest ›

CF 103373C - A Sorting Problem

Practice › Codeforces Solutions › 2021 ICPC Asia Taiwan Online Programming Contest ›

CF 103373F - Flip

We are maintaining a binary array, where each position is either 0 or 1, under two kinds of operations. One operation flips all bits in a given segment, turning 0 into 1 and 1 into 0.

Practice › Codeforces Solutions › 2021 ICPC Asia Taiwan Online Programming Contest ›

CF 103373E - Eatcoin

We are given a process that runs day by day. On day $d$, the process first consumes a fixed amount $p$ of Eatcoins. After paying this cost, it generates income equal to $q cdot d^5$. The algorithm only runs on a day if we can afford the consumption cost at the start of that day.

Practice › Codeforces Solutions › 2021 ICPC Asia Taiwan Online Programming Contest ›

CF 103373D - Drunk Passenger

We are looking at a sequential boarding process for a flight with $n$ seats and $n$ passengers. Each passenger has a fixed assigned seat, but the first passenger is drunk and behaves unpredictably: instead of sitting in their own seat, they pick a random seat uniformly from…

Practice › Codeforces Solutions › 2021 ICPC Asia Taiwan Online Programming Contest ›

CF 103373A - Olympic Ranking

We are given a small list of countries, each described by three integers: the number of gold, silver, and bronze medals it has won, followed by its name. Our task is to determine which country ranks highest under the standard Olympic ranking rules.

Practice › Codeforces Solutions › 2021 ICPC Asia Taiwan Online Programming Contest ›

CF 103373B - Aliquot Sum

We are given many positive integers, and for each one we must decide how “rich” its proper divisors are. For a number $n$, we consider all its divisors except $n$ itself, sum them up, and compare that sum against $n$.