Hi Codeforces,
AdhamAfterMidnight and I have added Session 4 : Number Theory to Focused CPCs Training.
There are 56 problems, divided into five consecutive parts:
| Part | Problems | Topics |
|---|---|---|
| 1 | 01–12 | Divisibility, remainders and modular arithmetic |
| 2 | 13–23 | Primes, sieves, factorization and divisors |
| 3 | 24–36 | GCD, LCM and coprimality |
| 4 | 37–49 | Arithmetic counting, totient, Möbius and divisor transforms |
| 5 | 50–56 | Digit number theory and integer equations |
Each part is ordered independently by estimated difficulty, from easier to harder. The difficulty resets when the next part begins. You can work through the collection in order or start with whichever topic you need.
For those who missed the previous post, the group collects problems from different CPC contests and organises them into topic-focused practice sessions.
We use the VoidHub CPC Archive to put these collections together. The archive contains the original contest collections; the group brings selected problems together by topic.
The archive covers ECPC, ACPC, Syrian CPCs, JCPC, KCPC and TCPC, as well as CERC, NWERC, SEERC, GCPC, BAPC, NCPC, UKIEPC, Ural, Dhaka, Jakarta, Azerbaijan and the North America Championship.
It also includes local and university contests from Damascus University, Aleppo, Al-Baath and Homs. Not every source appears in every session, and more sessions will follow.
Every statement begins with “Originally from: [contest name]”. These aren't our problems; all credit goes to the original authors.
The earlier sessions are still available:
- Session 1: Basics
- Session 2: Adhocs
- Session 3: Binary Search on Answer
The group is private for now. Send a join request and I'll accept it.
Corrections to statements, feedback on the ordering, and suggestions for future topics are welcome.
Комментарии (0)
