Latakia and Tartus Collegiate Programming Contest 2025

13 problems from Latakia and Tartus Collegiate Programming Contest 2025 (contest 105993), difficulty -. 5/13 solutions verified against sample I/O.

13 items

Latakia and Tartus Collegiate Programming Contest 2025

Special | 13 problems | 5/13 verified | Difficulty - | 7m 28s

#	Problem	Time	✓
A	Olives and Water	27s
B	Let's Go Swimming!	34s	✓
C	Shortest Cycle	52s	✓
D	Black Nodes	26s
E	Eating The Tree	32s
F	A Problem You Will Hate More Than Yourself 2	29s
G	Grid Game	47s	✓
H	Sortable Grid	24s
I	Largest Divisible by Nine	50s	✓
J	Pixel Canvas	59s	✓
K	An Easy Math Problem	21s
L	Dynamic String Array	21s
M	Rob And Lie	26s

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993M - Rob And Lie

I can’t write a correct editorial yet because the actual problem statement for Codeforces 105993M - Rob And Lie is missing from your message.

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993J - Pixel Canvas

In Codeforces 105993J, the canvas is an infinite grid. Some pixels are already colored, and we want to make every cell of a given rectangle colored using as few new coloring operations as possible.

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993L - Dynamic String Array

I can’t responsibly write a correct full editorial yet because the actual statement for “Codeforces 105993L - Dynamic String Array” is not available in the prompt and it does not appear in the standard Codeforces problemset archive.

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993I - Largest Divisible by Nine

We are given a multiset of decimal digits that we are allowed to reorder arbitrarily. From these digits we want to construct the largest possible number that is divisible by nine.

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993K - An Easy Math Problem

I can’t write a correct editorial for that problem yet because the actual statement is missing. “Codeforces 105993K - An Easy Math Problem” is not enough on its own to reconstruct the task reliably, and guessing would almost certainly lead to a wrong solution and…

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993G - Grid Game

We are working with two binary grids of the same dimensions. One grid is fixed as the target configuration, while the other starts completely empty.

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993H - Sortable Grid

Sure. Please provide the Codeforces problem statement (or a link/name), and I’ll write a detailed competitive programming editorial covering: - Problem restatement - Key observations - Derivation of the algorithm - Why naive approaches fail - Proof of correctness -…

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993F - A Problem You Will Hate More Than Yourself 2

The problem statement is missing from your prompt, so there isn’t enough information to derive an actual solution or write a correct editorial.

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993E - Eating The Tree

I can write the editorial, but I need one clarification first: Codeforces 105993E has a constructive output (a sequence of operations), and a complete editorial depends on the exact accepted construction.

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993D - Black Nodes

I can’t produce a correct, meaningful editorial for this problem as written because the actual problem statement is missing.

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993C - Shortest Cycle

We are given a graph where cities are connected by undirected roads, and each road connects two different cities. The task is to determine the length of the shortest simple cycle in this graph.

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993B - Let's Go Swimming!

The problem gives two proposed swimming times from two judges. Each judge suggests an integer moment when they want to go swimming, and the final decision is to choose the earliest possible moment so they can still attend the contest. The task is to output that earliest time.

Practice › Codeforces Solutions › Latakia and Tartus Collegiate Programming Contest 2025 ›

CF 105993A - Olives and Water

I can absolutely write this in the requested editorial style, but I’m missing the actual problem statement for Codeforces 105993A - Olives and Water. Right now, the prompt only includes headers without any description of the task, input/output format, or constraints.