### Hello Codeforces!↵
↵
We're glad to invite you to the [**Eolymp Blitz Round #12**](https://eolymp.com/en/contests/qjgameovtl0l7dprd0o9efta48) on [**8th February 2026, at 11:30 UTC**](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20260208T1130&ah=1&am=30&msg=Blitz%20Round%20%2312), a regular programming contest for beginners! ↵
↵
This is rated competition for members with rating $\le 1750$. ↵
↵
## Format and Difficulty↵
↵
The competition is meant help you get started with competitive programming and improve your problem solving skills. You will be given **1.5 hours** to solve **5 problems** of easy difficulty.↵
↵
The scoring for each task being block-based, meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block. If there is a tie between two participants, the one whose last productive submission (i.e., a submission that added at least one point) was made *earlier* will be ranked higher in the leaderboard.↵
↵
**Score distribution**:↵
↵
$$\large \color{red}{ 50-75-150-300-300}$$↵
↵
## Prizes↵
↵
The top-10 participants (with rating $\le 1750$) of the competition will receive **200 Eolymp Mints**.↵
↵
10 random participants among Top-100 (with rating $\le 1750$) who scored at least $51$ points will receive **100 Eolymp Mints** each..↵
↵
## Call for Tasks↵
↵
We are looking for problem setters to help us prepare for the upcoming rounds. Learn more about [**how to submit problem**](https://basecamp.eolymp.com/setting).↵
↵
## Credits↵
↵
- [user:mathmodel,2025-12-20] for coordinating the round.↵
- [user:kimononawa,2026-01-18] for authoring problems.↵
- **Sergey Kolodyazhnyy** for creating Eolymp 😎.↵
- [user:Connectus,2025-12-20] for Ukrainian Translations.↵
- [user:Mousa_Aboubaker,2026-02-02] , [user:Mohammed_Nasserr,2026-01-18] , [user:al95ireyiz,2026-02-01] , [user:Titan493ASST,2026-02-01] , [user:hickwhither,2026-02-01] , [user:MathModel,2026-02-01] ,[user:arpit_kr,2026-02-08] for testing the contest.↵
↵
↵
↵
We're looking forward for your participation!↵
↵
↵
### Congrats to Winners :↵
↵
1. [user:Egor,2026-02-08] (Congrats ! , AK after $30$ minutes !)↵
↵
2. [user:nyavim,2026-02-08] (Congrats ! , AK after $1$ Hour and $20$ minutes)↵
↵
3. [user:NPsolved.cpp,2026-02-08] (Congrats ! , AK after $1$ Hour and $35$ minutes)↵
↵
4. [user:balakrishnan,2026-02-08] (Congrats ! , AK after $1$ Hour and $37$ minutes)↵
↵
5. [user:Abdullah-Ishfaq,2026-02-08]↵
↵
6. [user:Nasa,2026-02-08]↵
↵
7. [user:late_night_dreams,2026-02-08]↵
↵
### Congrats to First Solvers :↵
↵
A : [user:NPsolved.cpp,2026-02-08]↵
↵
B : [user:late_night_dreams,2026-02-08]↵
↵
C : [user:Egor,2026-02-08]↵
↵
D : [user:Egor,2026-02-08]↵
↵
E : [user:Egor,2026-02-08]↵
↵
↵
We're glad to invite you to the [**Eolymp Blitz Round #12**](https://eolymp.com/en/contests/qjgameovtl0l7dprd0o9efta48) on [**8th February 2026, at 11:30 UTC**](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20260208T1130&ah=1&am=30&msg=Blitz%20Round%20%2312), a regular programming contest for beginners! ↵
↵
This is rated competition for members with rating $\le 1750$. ↵
↵
## Format and Difficulty↵
↵
The competition is meant help you get started with competitive programming and improve your problem solving skills. You will be given **1.5 hours** to solve **5 problems** of easy difficulty.↵
↵
The scoring for each task being block-based, meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block. If there is a tie between two participants, the one whose last productive submission (i.e., a submission that added at least one point) was made *earlier* will be ranked higher in the leaderboard.↵
↵
**Score distribution**:↵
↵
$$\large \color{red}{ 50-75-150-300-300}$$↵
↵
## Prizes↵
↵
The top-10 participants (with rating $\le 1750$) of the competition will receive **200 Eolymp Mints**.↵
↵
10 random participants among Top-100 (with rating $\le 1750$) who scored at least $51$ points will receive **100 Eolymp Mints** each..↵
↵
## Call for Tasks↵
↵
We are looking for problem setters to help us prepare for the upcoming rounds. Learn more about [**how to submit problem**](https://basecamp.eolymp.com/setting).↵
↵
## Credits↵
↵
- [user:mathmodel,2025-12-20] for coordinating the round.↵
- [user:kimononawa,2026-01-18] for authoring problems.↵
- **Sergey Kolodyazhnyy** for creating Eolymp 😎.↵
- [user:Connectus,2025-12-20] for Ukrainian Translations.↵
- [user:Mousa_Aboubaker,2026-02-02] , [user:Mohammed_Nasserr,2026-01-18] , [user:al95ireyiz,2026-02-01] , [user:Titan493ASST,2026-02-01] , [user:hickwhither,2026-02-01] , [user:MathModel,2026-02-01] ,[user:arpit_kr,2026-02-08] for testing the contest.↵
↵
↵
↵
We're looking forward for your participation!↵
↵
↵
### Congrats to Winners :↵
↵
1. [user:Egor,2026-02-08] (Congrats ! , AK after $30$ minutes !)↵
↵
2. [user:nyavim,2026-02-08] (Congrats ! , AK after $1$ Hour and $20$ minutes)↵
↵
3. [user:NPsolved.cpp,2026-02-08] (Congrats ! , AK after $1$ Hour and $35$ minutes)↵
↵
4. [user:balakrishnan,2026-02-08] (Congrats ! , AK after $1$ Hour and $37$ minutes)↵
↵
5. [user:Abdullah-Ishfaq,2026-02-08]↵
↵
6. [user:Nasa,2026-02-08]↵
↵
7. [user:late_night_dreams,2026-02-08]↵
↵
### Congrats to First Solvers :↵
↵
A : [user:NPsolved.cpp,2026-02-08]↵
↵
B : [user:late_night_dreams,2026-02-08]↵
↵
C : [user:Egor,2026-02-08]↵
↵
D : [user:Egor,2026-02-08]↵
↵
E : [user:Egor,2026-02-08]↵
↵
