HNNU Freshman Competition Round 2

7 problems from HNNU Freshman Competition Round 2 (contest 106153), difficulty -. 7/7 solutions verified against sample I/O.

7 items

HNNU Freshman Competition Round 2

Special | 7 problems | 7/7 verified | Difficulty - | 6m 5s

#	Problem	Time	✓
A	\u742a\u9732\u8bfa\u7684\u7b97\u6cd5\u8bfe\u5802	33s	✓
B	\u742a\u9732\u8bfa\u6570 Ciallo	49s	✓
C	\u742a\u9732\u8bfa\u653e\u51b0\u5757	54s	✓
D	\u742a\u9732\u8bfa\u7684\u65e0\u9650\u5faa\u73af\u5c0f\u6570	47s	✓
E	\u742a\u9732\u8bfa\u7684\u6700\u5927\u65b9\u5dee\u5b50\u5e8f\u5217	49s	✓
F	\u742a\u9732\u8bfa\u7684\u51b0\u6676\u6570\u5b66\u6311\u6218	52s	✓
G	\u742a\u9732\u8bfa\u5bfb\u627e\u9510\u89d2	1m 21s	✓

Practice › Codeforces Solutions › HNNU Freshman Competition Round 2 ›

CF 106153A - 琪露诺的算法课堂

The task is extremely direct: the program receives no meaningful structured input and is only required to print a fixed string. The output is always the same phrase, regardless of what the input would have been in a typical competitive programming setting.

Practice › Codeforces Solutions › HNNU Freshman Competition Round 2 ›

CF 106153D - 琪露诺的无限循环小数

The task revolves around deciding whether a given fraction produces a terminating decimal or an infinite repeating decimal when written in base 10. Each test case gives an integer denominator, and we implicitly consider the fraction $frac{1}{n}$.

Practice › Codeforces Solutions › HNNU Freshman Competition Round 2 ›

CF 106153G - 琪露诺寻找锐角

We are given several test cases. Each test case provides a sequence of points in the plane in a fixed order. The task is to determine whether there exists a triple of indices that forms a triangle with at least one strictly acute angle, and if so, output one such triple.

Practice › Codeforces Solutions › HNNU Freshman Competition Round 2 ›

CF 106153F - 琪露诺的冰晶数学挑战

We are given an array of integers for each test case and we are asked to pick two distinct elements and evaluate an expression formed from them.

Practice › Codeforces Solutions › HNNU Freshman Competition Round 2 ›

CF 106153E - 琪露诺的最大方差子序列

We are given an array of numbers and asked to choose a subsequence that maximizes the variance of its elements. Variance, in this context, measures how spread out the selected values are around their mean, so we want a subsequence whose values are as far apart as possible.

Practice › Codeforces Solutions › HNNU Freshman Competition Round 2 ›

CF 106153C - 琪露诺放冰块

We are given a rectangular board of size $n times m$. We also have rectangular blocks of size $a times b$. The task is to determine how many such blocks can be placed on the board if they are aligned to the grid and cannot overlap, and crucially, they cannot be rotated.

Practice › Codeforces Solutions › HNNU Freshman Competition Round 2 ›

CF 106153B - 琪露诺数 Ciallo

We are given five integers per test case, each representing how many times a specific letter or component is available.