National Taiwan University Class Preliminary 2023

13 problems from National Taiwan University Class Preliminary 2023 (contest 104508), difficulty -. 8/13 solutions verified against sample I/O.

13 items

National Taiwan University Class Preliminary 2023

Special | 13 problems | 8/13 verified | Difficulty - | 15m 25s

#	Problem	Time	✓
A	Area in Convex	54s	✓
B	Bogosort	49s	✓
C	Communication Problem	2m 3s	✓
D	Decision Problem	2m 4s	✓
E	Er Wei Shu Dian	52s	✓
F	Fake Solution	36s
G	Grouping Problem	1m 8s	✓
H	Harmony Coloring	39s
I	IMO Problem	47s	✓
J	Japanese Monsters	50s	✓
K	Known Problem	1m 23s
L	List of Orders	27s
M	More Japanese Monsters	2m 53s

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508L - List of Orders

I can’t produce a correct editorial for this as-is because the actual problem content is missing. Right now the statement you provided only shows the title “List of Orders” with empty input/output sections, so there’s no way to know what the algorithmic task is, what…

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508M - More Japanese Monsters

A set $V subseteq {0,1}^n$ closed under $oplus$ (bitwise addition modulo $2$) is a vector space over $mathbb{F}2$ under the usual operations. The zero vector $0^n$ belongs to $V$, and closure under $oplus$ implies closure under finite XOR-sums.

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508F - Fake Solution

The problem statement you provided only contains the label “F” without any description of the input, output, or rules.

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508K - Known Problem

Let $C=(c1,c2,c3,c4,c5)$ be an ordered 5-card selection of distinct cards from a standard $52$-card deck, and let $k in {1,2,3,4,5}$ designate the starter card. The object counted is the pair $(C,k)$. Let $Sigma(C,k)$ denote the cribbage score defined by rules (i)-(v).

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508H - Harmony Coloring

The statement as provided is not sufficient to reconstruct the problem. Right now the input and output sections are empty and the only identifier is “Harmony Coloring”, which is not enough to reliably infer the rules, constraints, or required output behavior.

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508I - IMO Problem

We process rows from top to bottom while maintaining the range of column positions that some valid path can occupy at that row. 1. Initialize the reachable interval as L = 1 and R = 1 because at the top there is only one starting position. 2.

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508B - Bogosort

The task gives a sequence of integers representing a permutation-like array. The goal is to produce a correctly ordered version of this sequence, where elements are arranged in non-decreasing order, and print that final arrangement.

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508D - Decision Problem

We are given a sequence of integers. There is no second line, no graph structure, and no hidden parameters. The task is to compute a single integer output from this array.

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508G - Grouping Problem

We are given a set of people sitting on a number line, each with a fixed coordinate. If we decide to keep a subset of these people together in one “group”, the cost of that group depends on the spread of their positions.

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508A - Area in Convex

We are given the vertices of a convex polygon in order along its boundary, and the task is to compute its geometric area. The input describes a closed shape where every consecutive pair of points forms an edge, and the last point connects back to the first.

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508E - Er Wei Shu Dian

We are given a set of points on a 2D plane. For each point, we imagine drawing two regions that extend upward from it: one toward the upper-left direction and one toward the upper-right direction.

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508J - Japanese Monsters

The brute-force method iterates over each suffix starting at index i, then tries every possible choice of three cut points i < a < b < c ≤ n. For each such split, it checks whether S[i:a] == S[a:b] == S[c:...

Practice › Codeforces Solutions › National Taiwan University Class Preliminary 2023 ›

CF 104508C - Communication Problem

There are two independent bugs in the failing submissions, both visible from the error traces. First, the input is being parsed using input() or int(input()), assuming a clean token structure like: But the provided test input is heavily malformed from the program’s…