IUT Eid Salami Programming Contest 2026 - Powered by Okkhor Technology (Online Mirror)
8 problems from IUT Eid Salami Programming Contest 2026 - Powered by Okkhor Technology (Online Mirror) (contest 106438), difficulty -. 2/8 solutions verified against sample I/O.
IUT Eid Salami Programming Contest 2026 - Powered by Okkhor Technology (Online Mirror)
Special | 8 problems | 2/8 verified | Difficulty - | 3m 31s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Obsession With Functions | 26s | ||||
| B | Does The Universe Really Exist? | 25s | ||||
| C | Roads in Laurasia | 37s | ✓ | |||
| D | Disaster Walker | 23s | ||||
| E | Race in Laurasia | 22s | ||||
| F | Thesis Group Selection | 24s | ||||
| G | Treasure Hunt in Laurasia | 32s | ✓ | |||
| H | Devils of Pestilence | 22s |
CF 106438G - Treasure Hunt in Laurasia
The palace is a grid of rooms, and every room contains a chest with a certain type. Chests are opened in increasing type order. After taking a chest of type x, the key inside allows access to any chest of type x + 1.
CF 106438H - Devils of Pestilence
Sure-please paste the Codeforces problem statement (or link + problem name), and I’ll write a full competitive programming editorial. If you want, tell me the style too (e.g., short + code-focused, or very detailed with proofs, or with alternative solutions).
CF 106438F - Thesis Group Selection
Sure. Please provide the Codeforces problem statement (or a link/title, constraints, and examples), and I’ll write a detailed competitive programming editorial with: - Problem restatement and key observations - Derivation of the main idea - Proof of correctness - Complexity…
CF 106438D - Disaster Walker
I can’t reliably reconstruct Codeforces 106438D - Disaster Walker from the ID alone, and the statement is not available in the context you provided.
CF 106438E - Race in Laurasia
I can write the full editorial, but I need the actual problem statement for Codeforces 106438E “Race in Laurasia”. The statement section in your prompt is empty, and I could not reliably recover the problem details from the available sources.
CF 106438C - Roads in Laurasia
The problem describes a connected tree of villages. A tree has exactly one route between any two villages, so every road is a single point of failure.
CF 106438A - Obsession With Functions
I can write the full editorial, but I need the actual problem statement for Codeforces 106438A - Obsession With Functions first. The statement section in your prompt is empty, and I cannot reliably reconstruct the problem from only the title and ID.
CF 106438B - Does The Universe Really Exist?
I don’t have the actual statement for Codeforces 106438B “Does The Universe Really Exist?” available in this context, and the title alone isn’t enough to reconstruct the intended logic reliably.