The 2nd Hangzhou Normal University Freshman Programming Contest

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

13 items

The 2nd Hangzhou Normal University Freshman Programming Contest

Special | 13 problems | 11/13 verified | Difficulty - | 11m 38s

#	Problem	Time	✓
A	KK \u753b\u732a	45s	✓
B	KK \u5b66\u51e0\u4f55	47s	✓
C	KK \u7b97\u65e5\u671f	2m 57s
D	KK \u4e0e\u5361\u724c	44s	✓
E	KK \u4e0e\u7b54\u8fa9	40s	✓
F	KK \u4e0e\u5237\u9898	43s	✓
G	KK \u770b\u8df3\u821e	42s	✓
H	KK \u4e0e\u5341\u4f73	40s	✓
I	KK \u4e70\u80a1\u7968	34s	✓
J	KK\u4e0e\u82f1\u8bed	38s	✓
K	KK \u4e0e\u7ebf\u4ee3	44s	✓
L	KK \u5b66\u4e94\u5b50\u68cb	1m 4s
M	KK \u4e0e\u4e8c\u53c9\u6811	40s	✓

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899M - KK 与二叉树

We are given multiple test cases. Each test case describes a binary tree only through two traversal orders: a preorder sequence and a postorder sequence. All node values are distinct, so each sequence is a permutation of the same set of integers.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899L - KK 学五子棋

Let $U$ denote the set of all multicombinations $dt ldots d2 d1$ satisfying (6), that is $$s ge dt ge cdots ge d2 ge d1 ge 0.$$ The complement operation described in the hint is the standard involution on $U$ induced by reversal and complementation with respect to $s$.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899K - KK 与线代

We are given a fixed 4×4 matrix where every entry is constant except for one position that depends on an integer variable $x$. For every integer $x$ in the range $[l, r]$, we evaluate the determinant of this matrix and are asked to find the minimum value over the entire range.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899J - KK与英语

We are given a single line of text representing a sentence that may contain the word “is” in different contexts.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899C - KK 算日期

Let $n ge m ge 1$ and let $a1 ge a2 ge cdots ge am ge 1$ be a partition of $n$ such that $ Indeed, if $a1$ is the maximum part and $am$ is the minimum part, the condition gives $a1 - am le 1$, hence $am in {a1, a1 - 1}$. Therefore every part equals either $a1$ or $a1 - 1$.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899H - KK 与十佳

We are given a list of integers representing scores assigned by judges. All values are nonzero and all are distinct. We are allowed to remove exactly one of these numbers. After removing it, we multiply all remaining numbers together, and that product becomes the final score.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899I - KK 买股票

We are given a sequence of stock prices over n days. On each day i, the stock has a known price p[i]. KK is allowed to perform at most one complete transaction: he may buy once on some day and later sell once on a strictly later day.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899G - KK 看跳舞

We are given multiple test cases. Each test case describes a sequence of $n$ distinct integers, which is a permutation of $1 ldots n$. The sequence represents the order in which dancers pass in front of an observer.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899F - KK 与刷题

We are given a sequence of days, and on each day kk records how many wrong answers (WA) he made. These values form an array a[1..n]. Starting from a score of zero, the score evolves day by day. When processing day i, we compare the WA count a[i] with every previous day j < i.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899D - KK 与卡牌

We are given two collections of heroes represented as cards. Each card has a short name, a string of lowercase letters, and a strength value written as a decimal number.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899E - KK 与答辩

We are given several independent test cases. In each test case, there are multiple “defense sessions”. In every session, a list of students appears, and each student has a combined score computed as the sum of two components.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899B - KK 学几何

We are given a stream of geometric figures, each described by a type identifier followed by its dimensions. Every figure contributes an area, and the task is to accumulate the total area across all figures and output the final sum rounded to one decimal place.

Practice › Codeforces Solutions › The 2nd Hangzhou Normal University Freshman Programming Contest ›

CF 102899A - KK 画猪

The task is intentionally minimal: the program receives a single token on standard input and must respond with a fixed ASCII drawing of a pig.