OCPC 2025 Winter, Day 1: Limas Sultan Agung

12 problems from OCPC 2025 Winter, Day 1: Limas Sultan Agung (contest 106444), difficulty -. 11/12 solutions verified against sample I/O.

12 items

OCPC 2025 Winter, Day 1: Limas Sultan Agung

Special | 12 problems | 11/12 verified | Difficulty - | 10m 51s

# Problem Rating Tags Accepted Time ✓
A Abadi Pikosom 1m 6s ✓
B Emang Harusnya Bet Merah 57s ✓
C Gegege 1m 12s ✓
D Ikam Bokam 36s
E Jsteyki 49s ✓
F Lama Pute Pute 51s ✓
G Like a Comet 59s ✓
H Limas Agung 1m 2s ✓
I Sarjana Excel 50s ✓
J Shuttekka Panorama 51s ✓
K Uau Aiai 47s ✓
L Ynoalgoget 51s ✓
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444B - Emang Harusnya Bet Merah

We are given several independent dice, where each die has its own list of face values. A single operation consists of rolling some of the dice, observing their outcomes, and deciding which dice to keep active for future rolls and which to lock permanently.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444I - Sarjana Excel

We are given a collection of rows, and for each row there are parameters that define how its contribution to the final answer depends on two global continuous variables. You can think of choosing a point in a 2D plane, and every row assigns a cost to that point.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444A - Abadi Pikosom

The underlying object in this problem is not immediately presented in a clean form. After stripping the narrative, the core structure is about permutations of $n$ elements and a quantity called “anger” that is accumulated during a process where people are processed in some…
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444G - Like a Comet

We are given a sequence of episodes, each carrying a numerical rating and a label that determines whether the episode is “excellent” or “ready”.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444L - Ynoalgoget

The task revolves around counting contributions of certain structured binary strings that are implicitly generated by a process that walks along a fixed “main string” and records how far it can match prefixes while extending.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444E - Jsteyki

The problem defines a notion of a “level” where movement between tiles follows chess bishop-like behavior, and each pair of tiles has an associated minimum time required to move between them.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444J - Shuttekka Panorama

We are given an array of values over positions, and a list of queries. Each query specifies a contiguous segment of the array. For each segment, we look at all elements inside it and identify where the maximum value occurs.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444F - Lama Pute Pute

We are given an array-like structure that can be interpreted as a set of positions for dancers, where each position contributes to a global score through a number-theoretic interaction.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444D - Ikam Bokam

The statement you provided is not usable for reconstructing the problem. “Codeforces 106444D - Ikam Bokam” appears with an empty description (“Add .”) and no input/output format, constraints, or meaningful task description.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444K - Uau Aiai

The task describes a hierarchical route planning problem over three layers of locations. At the lowest level there are individual locations inside a city, inside cities grouped into a country, and finally countries grouped into a global structure.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444H - Limas Agung

We are given a rooted structure that behaves like a tree, where each node carries a value that is constrained by how paths behave from the root down to the leaves.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › OCPC 2025 Winter, Day 1: Limas Sultan Agung ›

CF 106444C - Gegege

We are given a string consisting only of two symbols, which we can think of as G and E. We reinterpret this string as a walk on a number line: reading a G increases a running value by one, and reading an E decreases it by one.
codeforces competitive-programming Jun 19, 2026