The 2023 ICPC Asia Xian Regional Contest (The 3rd Universal Cup. Stage 9: Xian)
14 problems from The 2023 ICPC Asia Xian Regional Contest (The 3rd Universal Cup. Stage 9: Xian) (contest 105471), difficulty -. 4/14 solutions verified against sample I/O.
The 2023 ICPC Asia Xian Regional Contest (The 3rd Universal Cup. Stage 9: Xian)
ICPC/IOI | 14 problems | 4/14 verified | Difficulty - | 17m 48s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | An Easy Geometry Problem | 1m 51s | ✓ | |||
| B | Counting Multisets | 2m 39s | ||||
| C | Counting Strings | 3m 2s | ||||
| D | Bracket Sequence | 1m 38s | ||||
| E | Dominating Point | 1m 40s | ||||
| F | An Easy Counting Problem | 1m 57s | ✓ | |||
| G | An Easy Math Problem | 1m 40s | ✓ | |||
| H | Elimination Series Once More | 24s | ||||
| I | Max GCD | 45s | ✓ | |||
| J | Graph Changing | 27s | ||||
| K | Penguins in Refrigerator | 25s | ||||
| L | Prism Palace | 27s | ||||
| M | Random Variables | 24s | ||||
| N | Python Program | 29s |
CF 105471N - Python Program
I can’t write a correct Codeforces editorial from that input because the actual problem statement is missing. Right now all we have is the title “105471N - Python Program”, but no description of what the program is supposed to do, what the input format is, or what output…
CF 105471M - Random Variables
The problem statement section is empty, so there isn’t enough information to derive the solution or write a correct editorial.
CF 105471L - Prism Palace
The problem statement for Codeforces 105471L - Prism Palace is missing from your prompt, so there isn’t enough information to reconstruct the task, constraints, or required algorithm.
CF 105471K - Penguins in Refrigerator
I can write the full editorial in the format you want, but the actual problem content is missing. Right now the statement sections are empty, so there is no way to reliably reconstruct: - what the input represents - what needs to be computed - what algorithmic structure is…
CF 105471J - Graph Changing
I can’t write a correct editorial for “Codeforces 105471J - Graph Changing” without the actual problem statement.
CF 105471I - Max GCD
We are given an array of integers and multiple queries. Each query selects a contiguous segment, and we must compute a value derived from all triples of indices inside that segment.
CF 105471H - Elimination Series Once More
The statement section is empty, so there isn’t enough information to reconstruct what Codeforces 105471H actually asks.
CF 105471F - An Easy Counting Problem
We are counting structured pairs of integers $(a,b)$ under a modular constraint on binomial coefficients. Each valid pair is formed by choosing two numbers $a$ and $b$, with $b$ never exceeding $a$, and both bounded by a very large limit: all values lie in $[0, p^k)$.
CF 105471E - Dominating Point
We are given a fully oriented complete graph, meaning every pair of distinct vertices has exactly one directed edge between them. For each vertex $u$, the input tells us exactly which vertices it points to.
CF 105471D - Bracket Sequence
We are given a binary string made of parentheses. From any substring we are allowed to pick a subsequence, and we are interested in a very rigid kind of subsequence: it must look like several copies of “()” concatenated together.
CF 105471A - An Easy Geometry Problem
We are given an array of integers and a fixed linear rule that relates a “radius” around an index to a value computed from the array. For a chosen center position $i$, we look symmetrically to the left and right.
CF 105471G - An Easy Math Problem
We are given a positive integer $n$. We look at all ways to pick two positive integers $p$ and $q$ such that their product divides $n$, and additionally $p le q$. For each valid pair, we compute a value $r = frac{p}{q}$.
CF 105471C - Counting Strings
We are given a string indexed from 1 to n. We look at pairs of indices $(l, r)$ with $l le r$. Each such pair defines a substring $s[l..r]$, but we only accept it if the endpoints are coprime, meaning $gcd(l, r) = 1$.
CF 105471B - Counting Multisets
We are counting how many multisets of non-negative integers satisfy three simultaneous constraints, but the constraints are expressed in a slightly indirect way. Each multiset has size $n$, so it contains exactly $n$ elements when multiplicities are expanded.