2026 Kruskal Cup

Revision en10, by Eason_He, 2026-08-22 18:15:52

2026 Kruskal Cup Programming Contest

The Kruskal Cup Programming Contest, also known as the University of Science and Technology of China (USTC) Freshman Programming Contest, is one of the most important activities organized by the Computer Programming Club each year.

Timeline

Event Time
Registration from 5th Sept, 2026, 12:00 to 12th Sept, 2026, 12:00
Warm-up Practice from 6th Sept, 2026, 12:00 to 13th Sept, 2026, 12:00
Contest 13th Sept, 2026, from 12:00 to 17:00

Contest Details

Staff

Features

  • Inclusive for All Levels: Designed for beginners and experts alike to learn, compete, and enjoy.
  • Meticulously Crafted Problems: Original, high-quality tasks tested across diverse skill tiers.
  • Balanced Difficulty Curve: Thoughtfully graded challenges for a smooth and rewarding progression.

Registration

  • Method : The judging system for this contest is USTCOJ.
  • For USTC students: You should log in through the unified identity authentication system.
  • For non-USTC students: You should send an email to [Email Address] with the subject line 2026 Kruskal Cup Registration. We will create an account for you and send you the username and password via email. You will be free to change your nickname once you log in.
  • Requirements : No restrictions.

Difficulty

Note : The problems are not sorted by difficulty. Therefore, you should solve the problems optimally and manage your time wisely. A great strategy is to follow the others by checking the scoreboard to identify the easier problems during the contest.

The problem set is designed to accommodate participants of all skill levels, with Codeforces equivalent difficulty ranging approximately from 800 to 3500:

  • Beginner-Friendly : Entry-level problems focusing on basic implementation and simple logic.
  • Medium : Intermediate problems that require standard algorithms, data structures, and observations.
  • Advanced : The watershed problems for strong competitors.
  • Expert : The ultimate boss problems designed to prevent a full clear (AK).

Venue

  • For USTC freshmen and first-year master's students, you must attend the contest on-site.
  • For other USTC students, you can choose to attend the contest either online or on-site.
  • For non-USTC students, we regret to inform you that campus access is restricted, so you may only attend the contest online.

Description

You will be asked to solve 11 problems in 5 hours. The contest will follow standard ICPC rules and formats. You should submit your solutions on USTCOJ.

If you encounter any issues during the contest, please submit them via the clarification system (or raise your hand if you are an on-site participant), and we will reply to you or make a global announcement. The contest may feature traditional problems, interactive problems, communicative problems, and/or output-only problems. Our online judge system supports C, C++, and Python.

We will provide problem statements in both Chinese and English. For on-site participants, we will provide one printed Chinese problem statement per person.

Rules

All rules are identical to standard ICPC rules, with the following exceptions:

  • On-site participants are allowed to bring and use their own computers.

  • This is an individual competition, rather than a team competition (teams of up to three).

  • Participants are allowed to use AI strictly for translation purposes only, using the exact prompt below:

> Translate the following text into [LANG]. Do not summarize, omit, or rephrase anything. Preserve the exact meaning of the original text. Provide only the translation, with no additional explanations, notes, or commentary. The text is: [Content]

  • For online participants: To be eligible for prizes, you must submit a complete screen recording covering the entirety of your competition to [Submission Link/Email Address].

Award Eligibility & Rules

[Detail the prize pools, medal distribution, criteria for winning, and any separate rankings for freshmen vs. open participants here.]

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en50 English Eason_He 2026-09-07 12:30:42 316
en49 English Eason_He 2026-09-03 19:56:08 59 Tiny change: '026-08-30]\n- **AI ' -> '026-08-30], [user:bookcat], [user:o_yingxing_o]\n- **AI '
en48 English Eason_He 2026-08-31 07:55:41 166
en47 English Eason_He 2026-08-31 07:48:16 329
en46 English Eason_He 2026-08-30 16:35:24 0 (published)
en45 English Eason_He 2026-08-30 16:30:48 2 Tiny change: ',2026-05-21], [user:r' -> ',2026-05-22], [user:r'
en44 English Eason_He 2026-08-30 16:26:26 2 Tiny change: 'dard threeperson tea' -> 'dard three person tea'
en43 English Eason_He 2026-08-30 16:26:01 86
en42 English Eason_He 2026-08-30 16:23:48 6 Tiny change: '1el,2026-08-30], [user:r' -> '1el,2026-05-21], [user:r'
en41 English Eason_He 2026-08-30 16:23:06 6 Tiny change: ':1xx55,2026-08-21]\n- **Hum' -> ':1xx55,2024-08-04]\n- **Hum'
en40 English Eason_He 2026-08-30 16:22:21 128
en39 English Eason_He 2026-08-30 16:21:37 8 Tiny change: ' [USTCOJ](oj.ustc.ed' -> ' [USTCOJ](https://oj.ustc.ed'
en38 English Eason_He 2026-08-30 16:21:12 14 Tiny change: ' [USTCOJ]() for USTC' -> ' [USTCOJ](oj.ustc.edu.cn) for USTC'
en37 English Eason_He 2026-08-30 16:20:33 208
en36 English Eason_He 2026-08-30 15:57:00 14 Tiny change: 'uan001,2026-08-30], [user:D' -> 'uan001,2025-01-26], [user:D'
en35 English Eason_He 2026-08-30 15:55:14 313 Tiny change: 'p Practice | from [6' -> 'p Practice(USTCOJ available only) | from [6'
en34 English Eason_He 2026-08-29 04:00:09 1 Tiny change: 'odeforces equivalen' -> 'odeforces equivalen'
en33 English Eason_He 2026-08-28 18:01:05 17 Tiny change: '2], [user:linglingmao,2026-08-2' -> '2], [user:sayu_zzz,2026-08-2'
en32 English Eason_He 2026-08-28 17:46:51 16 Tiny change: 'extra-high\n\n### Fe' -> 'extra-high, Gemini 3.1 Pro\n\n### Fe'
en31 English Eason_He 2026-08-28 17:42:57 2 Tiny change: 'to solve 12 problems ' -> 'to solve 13 problems '
en30 English Eason_He 2026-08-28 17:39:13 12
en29 English Eason_He 2026-08-28 17:37:43 483 Tiny change: '1930&ah=5) |\n\n## C' -> '1930&ah=5)[contest_time:713153] |\n\n## C'
en28 English Eason_He 2026-08-25 18:29:52 27 Tiny change: '1], [user:w' -> '1], [user:pjz_pjz], [user:w'
en27 English Eason_He 2026-08-25 17:58:39 47
en26 English Eason_He 2026-08-25 17:55:57 133
en25 English Eason_He 2026-08-25 17:54:29 98
en24 English Eason_He 2026-08-25 17:44:43 247
en23 English Eason_He 2026-08-25 17:37:19 174
en22 English Eason_He 2026-08-25 17:32:45 43
en21 English Eason_He 2026-08-25 16:28:48 2 Tiny change: 'to solve 11 problems ' -> 'to solve 12 problems '
en20 English Eason_He 2026-08-25 13:07:43 71
en19 English Eason_He 2026-08-25 11:16:29 7 Tiny change: 'pt below: \n\n >`Translate' -> 'pt below: `Translate'
en18 English Eason_He 2026-08-25 11:16:10 1 Tiny change: 'w: \n\n > `Translate' -> 'w: \n\n >`Translate'
en17 English Eason_He 2026-08-24 10:13:05 50
en16 English Eason_He 2026-08-24 10:10:58 8
en15 English Eason_He 2026-08-24 09:43:51 4
en14 English Eason_He 2026-08-24 09:43:26 280
en13 English Eason_He 2026-08-23 13:59:04 187
en12 English Eason_He 2026-08-22 18:18:56 1 Tiny change: '** : Kimi 3, \n\n###' -> '** : Kimi k3, \n\n###'
en11 English Eason_He 2026-08-22 18:18:15 22 Tiny change: 'sters** : [Model 1], [Model 2]\n\n### Fe' -> 'sters** : Kimi 3, \n\n### Fe'
en10 English Eason_He 2026-08-22 18:15:52 79
en9 English Eason_He 2026-08-21 14:57:10 30
en8 English Eason_He 2026-08-21 14:56:40 2 Tiny change: 'ression.\n### Regi' -> 'ression.\n\n### Regi'
en7 English Eason_He 2026-08-21 14:56:02 1010
en6 English Eason_He 2026-08-21 14:54:44 117
en5 English Eason_He 2026-08-21 14:53:54 637
en4 English Eason_He 2026-08-21 14:01:35 25
en3 English Eason_He 2026-08-21 13:59:57 31 Tiny change: '1], [user:1' -> '1], [user:wuxigk], [user:1'
en2 English Eason_He 2026-08-21 02:49:17 131 Tiny change: 'Huasushis]\n- **Huma' -> 'Huasushis], mmt\n- **Huma'
en1 English Eason_He 2026-08-20 17:45:51 3688 Initial revision (saved to drafts)