Invitation to HackerEarth CodeMonk (Number Theory Part 1)

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

#	User	Contrib.
1	cry	167
2	maomao90	163
2	Um_nik	163
4	atcoder_official	161
5	adamant	159
6	-is-this-fft-	158
7	awoo	157
8	TheScrasse	154
9	nor	153
9	Dominater069	153

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.