The 4th Hangzhou Normal University Freshman Programming Contest

13 problems from The 4th Hangzhou Normal University Freshman Programming Contest (contest 103480), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The 4th Hangzhou Normal University Freshman Programming Contest

Special | 13 problems | 13/13 verified | Difficulty - | 10m 27s

# Problem Rating Tags Accepted Time ✓
A \u89e3\u5f00\u675f\u7f1a\u7f20\u4e1d\u2161 41s ✓
B 7 \u7684\u610f\u5fd7 42s ✓
C \u8ff7\u5bab\u7684\u5341\u5b57\u8def\u53e3 1m 9s ✓
D \u8f6c\u52a8\u547d\u8fd0\u4e4b\u8f6e 59s ✓
E \u8ba1\u7b97\u6700\u5c0f\u503c 1m ✓
F \u6708\u5149\u594f\u9e23\u66f2 44s ✓
G \u7535\u5b50\u8868\u6821\u5bf9 52s ✓
H \u7b80\u5355\u7684 LRU \u95ee\u9898 42s ✓
I \u597d\u60f3\u542c\u8086\u5b9d\u5531\u6b4c\u554a 46s ✓
J \u6bc1\u706d\u51e4\u51f0\u4eba 46s ✓
K \u6b22\u8fce\u6765\u5230\u676d\u5e08\u5927 46s ✓
L Ayanoto \u53d8\u5f62\u8bb0 40s ✓
M P \u9f99\u5b66\u957f\u7684\u6559\u8bf2 40s ✓
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480L - Ayanoto 变形记

We are given a circular track with $n$ equally spaced positions labeled from $0$ to $n-1$. A frog starts at position $0$. Each move forces the frog to jump exactly $x$ steps forward along the circle, meaning from position $i$ it always lands at $(i + x) bmod n$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480M - P 龙学长的教诲

We are given several independent lines of text. Each line represents a sentence that has been distorted by a specific reordering rule applied to its words.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480K - 欢迎来到杭师大

We are given a single integer n, and we are asked to print a fixed message exactly n times, each occurrence on its own line. The message itself is always identical and does not depend on any input besides n.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480J - 毁灭凤凰人

We are given a very small hand of at most ten cards and a single boss monster with fixed combat statistics. Our goal is to determine whether we can remove this boss from the game in a way that prevents it from ever coming back. The boss interacts with our cards in two phases.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480I - 好想听肆宝唱歌啊

We are given a collection of songs, where each song has a unique popularity value and a unique name. The popularity value acts like a strict ranking key: no two songs share the same score, and higher values mean a song is more desired.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480G - 电子表校对

We are given two time displays written in a digital, seven segment style where each digit is rendered as a fixed 3 by 3 character block. Each time consists of six digits: two for hours, two for minutes, and two for seconds.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480H - 简单的 LRU 问题

We are simulating how an operating system manages a small, fixed-size memory cache using the Least Recently Used policy. Memory is divided into a tiny number of slots, and we receive a sequence of memory access requests.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480F - 月光奏鸣曲

We are given two square grids of the same size, each cell containing an integer color. The only operation allowed on the first grid is a rotation around its center by 90 degrees, either clockwise or counterclockwise, and we may apply this operation multiple times.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480E - 计算最小值

We are given several arrays, and from each array we must choose exactly one value. After that selection, we conceptually have a multiset of size n.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480D - 转动命运之轮

We are given an initial lineup of $n$ children, each child $i$ has a fixed happiness value $hi$. The toys are initially shuffled by a permutation: child $i$ receives a toy labeled $wi$, so the array $w$ is a permutation of $1 dots n$. The process then evolves in rounds.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480C - 迷宫的十字路口

We are working on an infinite grid, but movement is heavily restricted: the player can only travel along the two coordinate axes. At the beginning, the player starts at the origin.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480B - 7 的意志

We are given several independent test cases. In each test case we receive an array of positive integers, and the task is to count how many subarrays have sum exactly equal to 7777.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 4th Hangzhou Normal University Freshman Programming Contest ›

CF 103480A - 解开束缚缠丝Ⅱ

We are given several test cases. In each case, we receive a multiset of single characters. Each character can be used at most once, and we are allowed to rearrange the chosen characters in any order.
codeforces competitive-programming Jul 3, 2026