I would like to invite all of you to the International Coding Marathon 2021, under the banner of Technex’21, IIT (BHU) Varanasi.
Technex is the annual techno-management fest of Indian Institute of Technology (BHU), Varanasi organized from April 2-6, 2021.
International Coding Marathon is the flagship event of Byte The Bits, the set of programming events organized under Technex. It will take place on 6th April from 8pm - 10:30pm IST.
Click here to go to the contest page.
The problemset has been prepared by Yash Goyal, Mihil Gupta, Anshu Garg, Jatin Garg, Anant Saxena, Ashish Patel, Sharabh Agrawal and me, Shikhar Sharma.
I would like to thank Jatin Yadav , Ashish Gupta, Felipe Mota and Rahul Dugar for their invaluable help in testing and preparation of the contest.
Some of our previous contests :
ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)
ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)
ICM Technex 2019
ICM Technex 2020
Participants will have 2.5 hours to solve 8 problems. The scoring will be ICPC style. Contest will be rated for Div. 2 and Div. 3 participants, but it has exciting problems and great prizes for everyone!
Global 1st - worth 10k
Global 2nd - worth 7k
Global 3rd - worth 5k
India 1st - worth 4k
IIT BHU (overall 1st) - worth 3k
IIT BHU 1st year - worth 1k
Good luck everyone! Hope to see you on the leaderboard.
As a problem setter, I can confirm that the problems are Interesting and have short and clear statements.
Are prizes only for div-2,3 peeps? I mean there are 3 different ranklists so wdym by Global 1st,2nd etc…
No, anyone can get the prize. We will compare the ranklists to decide the winners.
Please give the Contest link In the Post. For Better reach😊
The prizes are for everyone, not just college students!
Do we have to register for participating in the contest?
its contests like these which makes me wonder whether cp is something for a retard like me
maybe i should start selling mangoes and watermelons in the streets of calcutta
Cool problems, How did you guys do Stack of Rectangles? My idea was to express the area of the stack in terms of the y coordinates and then use lagrangian multiplier over them but I wonder if there’s a simpler way to do it.
Hey everyone, we hope you enjoyed the contest. Please provide us with your valuable feedback.
You can solve it using similar triangles. For detailed explanation, we will release the editorials in some time.
I think problems were hard enough for this contest to be rated for Div1 too.
pls see this and explain why this happen
tell how to do suffix sort
Can someone explain the infinite polygon solution?
Rotated sorted array is only possible array to fix. rest is impossible to do.
ans= 1/(1-(sin(theta in radians))^2).
long double x=sin(ang);
why is expectation not taken as E(X) = Sigma xi*P(X=xi) ? X is random variable representing number polynomials the point is inside. And P is area of sub polynomials.
Also i still don’t understand that logic. Something i am missing but i don’t know what.