Hello, Codeforces!
We are happy to invite you to TheForces Round #22 (Interesting-Forces), which will take place on Aug/27/2023 17:35 (Moscow time)
What is TheForces Round?
You will have 135 minutes to solve 6 problems.
We strongly recommend you to read all problems.
The round is TheForces rated!, after the round you can find your rating changes here.
Problems were prepared and authored by Amir_Parsa, wuhudsm, chromate00, EyadBT, JaberSH1.
We would like to thank our army of testers: k1r1t0, Little_Sheep_Yawn, blxst, milind0110, pd_codes, vikram108, astilate, _Aryan_, udta_kouwa, Banis, yash_04, lengmuzhaxi, Binary_Thinker.
Also we want to thank You for participating in our round.
Discord Server (1000+ people)
As a tester, I can confirm that the problems are very interesting. And very enjoyable to solve.
Hopefully, it would be a INTERESTING ROUND for you! We've made a lot of adjustments to make the problems better. Wish you all the best!
(plus: plz give me contribution, thx!)
Upvoted!
As an author, I'd like to thank everyone who contributed to this round, especially Yawn for testing :D
This is my first time ever to be an author :D
Couldn't have been done without my G EyadBT, special thanks to him :)
No u u
:pleading_face:
thank you for the round and I hope the problems are interesting
This round is very challenging. As a tester, I enjoyed problem solving. All the Best to everyone!
The registration is open!
Is there any simple solution to B?
Or is it just casework like I did?
when n=1 the concatination of k with its self will never be prime if k>1,but if k=1 it will. thats beacuse when you concatenate k with its self it will be writen like k times 10 to some power puls k and this expression is divisable by k which is greater than 1
Editorial