Zaglol Contest - FCDS level 1 contest 2026

10 problems from Zaglol Contest - FCDS level 1 contest 2026 (contest 106350), difficulty -. 6/10 solutions verified against sample I/O.

10 items

Zaglol Contest - FCDS level 1 contest 2026

Special | 10 problems | 6/10 verified | Difficulty - | 6m 10s

#	Problem	Time	✓
A	Zaglol welcoming	28s	✓
B	Baby Baraa in ALBAIK	1m 55s
C	Kero ! Kero ! El3ab ya Kero !	27s
D	Sahla bas Sa7la	25s
E	Zeyad's Symmetric Functions	29s	✓
F	Franco Haters Club	24s
G	No story, No ACs, Many WAs, just an unsolvable problem	22s	✓
H	Zaglol vs. the British Occupation	39s	✓
I	Swap(Mohamed, !Mohamed)	31s	✓
K	Wahban and brackets	30s	✓

Practice › Codeforces Solutions › Zaglol Contest - FCDS level 1 contest 2026 ›

CF 106350K - Wahban and brackets

The string contains only round brackets. We need remove some characters while keeping the remaining indices in their original order. The goal is to obtain the longest subsequence whose reversal is a regular bracket sequence.

Practice › Codeforces Solutions › Zaglol Contest - FCDS level 1 contest 2026 ›

CF 106350H - Zaglol vs. the British Occupation

We are given a line of enemies, each with a positive strength. For each query, Zaglol starts with a sword of some initial power and tries to defeat as many enemies as possible.

Practice › Codeforces Solutions › Zaglol Contest - FCDS level 1 contest 2026 ›

CF 106350B - Baby Baraa in ALBAIK

Sure. Please provide the Codeforces problem statement (or link/name), and I’ll write a detailed competitive programming editorial including: - Problem restatement - Key observations - Step-by-step derivation of the solution - Algorithm - Correctness proof - Complexity analysis…

Practice › Codeforces Solutions › Zaglol Contest - FCDS level 1 contest 2026 ›

CF 106350I - Swap(Mohamed, !Mohamed)

The problem describes a row of boxes. Some boxes contain Mohamed, represented by 1, while empty boxes are represented by 0. Mohamed wants to choose one box as the final meeting point and move every Mohamed currently in another box to that chosen box.

Practice › Codeforces Solutions › Zaglol Contest - FCDS level 1 contest 2026 ›

CF 106350G - No story, No ACs, Many WAs, just an unsolvable problem

This problem is a meta-problem rather than a normal algorithmic task. The title itself describes the intended situation: there is no meaningful story, no accepted solution, many wrong attempts, and the task is intentionally impossible.

Practice › Codeforces Solutions › Zaglol Contest - FCDS level 1 contest 2026 ›

CF 106350F - Franco Haters Club

I can’t write a correct editorial for this problem as-is because the actual problem statement (what the inputs mean, what needs to be computed, and the constraints) is missing.

Practice › Codeforces Solutions › Zaglol Contest - FCDS level 1 contest 2026 ›

CF 106350E - Zeyad's Symmetric Functions

The problem asks us to consider the curve defined by the reciprocal function, where the input gives an interval of integer x-coordinates. For every nonzero integer inside that interval, we draw the tangent line to the curve at that x-coordinate.

Practice › Codeforces Solutions › Zaglol Contest - FCDS level 1 contest 2026 ›

CF 106350D - Sahla bas Sa7la

I can’t responsibly write a correct editorial for this yet because the actual problem statement for Codeforces 106350D - Sahla bas Sa7la is not fully available in a clean, complete form from the sources we retrieved.

Practice › Codeforces Solutions › Zaglol Contest - FCDS level 1 contest 2026 ›

CF 106350A - Zaglol welcoming

The task is intentionally simple. We receive a string from the input, but the content of that string has no effect on the answer. Regardless of what the user enters, the program must print the fixed message FCDS.

Practice › Codeforces Solutions › Zaglol Contest - FCDS level 1 contest 2026 ›

CF 106350C - Kero ! Kero ! El3ab ya Kero !

I’m missing the actual full statement for this problem, and the snippet that came through is inconsistent (it even merges parts of multiple different Codeforces problems).