The 3rd Hangzhou Normal University Freshman Programming Contest

13 problems from The 3rd Hangzhou Normal University Freshman Programming Contest (contest 102897), difficulty -. 11/13 solutions verified against sample I/O.

13 items

The 3rd Hangzhou Normal University Freshman Programming Contest

Special | 13 problems | 11/13 verified | Difficulty - | 14m 1s

#	Problem	Time	✓
A	XCPCIO Board CLI Easy	49s	✓
B	BM \u7b97\u65e5\u671f	39s	✓
C	BBpigeon Counting Trees	44s	✓
D	Palindrome Hard Problem	46s	✓
E	BM \u5145\u9965	2m 42s
F	kita \u4e70\u793c\u7269	40s	✓
G	New Game	2m 34s
H	Hsueh- Draw Progress	48s	✓
I	BM \u65c5\u6e38	34s	✓
J	\u5927\u626b\u9664	35s	✓
K	Kwords Find Kth Element	42s	✓
L	\u5486\u54ee	1m 24s	✓
M	XCPCIO Board CLI Hard	1m 4s	✓

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897G - New Game

Let $C subseteq mathcal{P}({0,1,dots,n-1})$ be a clutter, meaning that no two distinct sets in $C$ are comparable under inclusion. Let $Mt$ denote the number of $t$-element sets in $C$.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897M - XCPCIO Board CLI Hard

We are given a simulation of a programming contest where many teams submit solutions to several problems over time. Each submission happens at a timestamp and either solves a problem (AC) or fails (WA).

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897E - BM 充饥

A partition of $n$ in part-count form is a vector $c1,dots,cn$ satisfying $c1+2c2+cdots+n cn=n,$ where $ck$ is the number of parts equal to $k$.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897L - 咆哮

There are two enemy forces, each with its own health pool and a fixed per-round damage value. Time progresses in discrete rounds, and in round $i$, the player is forced to use exactly $i$ attack power in total, and all of it must be directed to exactly one of the two enemies.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897H - Hsueh- Draw Progress

The task is to render a command line progress indicator for multiple scenarios. Each scenario describes a total amount of work and how much of it is already completed.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897K - Kwords Find Kth Element

We are given several independent arrays. Each array contains integers, and across all arrays the total number of elements is at most one hundred thousand. After reading these arrays, we process a sequence of queries.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897J - 大扫除

We are given several independent building descriptions. Each building consists of multiple floors, and each floor is represented by a string. Characters in the string describe whether a position contains trash and what type it is.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897I - BM 旅游

We are given four large integers. Each integer is not directly the object of interest. Instead, each one encodes whether a particular sightseeing location has been visited.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897D - Palindrome Hard Problem

We start with a collection of $n$ strings, all having the same length $m$, and only lowercase letters. The allowed operations let us repeatedly reduce the number of strings by either merging two strings in a few different ways or discarding one string entirely.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897F - kita 买礼物

We are given a collection of coin types. Each type has a fixed denomination and a limited supply. From these coins, we want to know how many distinct total sums we can form using any combination of coins, but only considering totals from 1 up to m.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897A - XCPCIO Board CLI Easy

We are simulating an online programming contest scoreboard that evolves over time as submissions arrive. Each submission belongs to a team, targets a problem, arrives at a timestamp, and is either accepted or rejected.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897B - BM 算日期

We are given a starting year and an integer shift. The shift is applied to the year, but the result is not used directly.

Practice › Codeforces Solutions › The 3rd Hangzhou Normal University Freshman Programming Contest ›

CF 102897C - BBpigeon Counting Trees

We are given a rooted tree structure indirectly, not by edges, but by a list of depths for each node. Node 1 is fixed as the root, and every node i comes with an integer ai describing how far it is from the root in terms of number of nodes on the path, including itself.