Hello Codeforces,
After a long gap of 3 weeks, Monk is back with CodeMonk (Number Theory Part 1). The contest will start on December, 5 21:00 IST (check your timezone). Contest will run for 3 hours. The topic we will be focusing on in this contest are:
- Modular Arithmetic
- Modular Exponentiation
- GCD / LCM
- Extended Euclidean Algorithm
- Modular Multiplicative Inverse
- Prime Numbers
- Prime Factors
I would like to invite you to participate in the contest. The problemset consists of 5 traditional algorithmic tasks. You will receive points for every test case your solution passes — so you can get some points with partial solutions as well.
I am one of the tester of the problemset you will be working on: thanks to prat33k, MazzForces, vaibhavjaimini and trytolearn.
Tasks should not be very hard for top-level contestants, and I expect them to get full score. Codemonk focuses on aspiring programmers who aim to be better at coding. However, expert programmers can also use it as a means to revise concepts and improve their programming karma.
