Invitation to HackerEarth CodeMonk (Number Theory Part 1)

#	User	Rating
1	tourist	3985
2	jiangly	3814
3	jqdai0815	3682
4	Benq	3529
5	orzdevinwang	3526
6	ksun48	3517
7	Radewoosh	3410
8	hos.lyric	3399
9	ecnerwala	3392
9	Um_nik	3392

#	User	Contrib.
1	cry	170
2	maomao90	162
2	Um_nik	162
4	atcoder_official	160
5	djm03178	158
5	-is-this-fft-	158
7	adamant	154
7	Dominater069	154
9	awoo	153
10	luogu_official	152

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.