Invitation to ICM Technex 2020 - IIT (BHU) Varanasi

Hello CodeChef Community,

I would like to invite you all to the International Coding Marathon 2020 , under the banner of Technex’20, IIT (BHU) Varanasi.

Technex is the annual techno-management fest of Indian Institute of Technology (BHU), Varanasi organized from February 14 — 16, 2020.

International Coding Marathon is the flagship event of Byte The Bits, the set of programming events organized under Technex. It will take place on Sunday, 16th Feb 2020, 14:00 IST.

The problemset has been prepared by Anshul Asawa, Bhagya Kamal Jain, Mihil Gupta , Naman Jain and me (Abhas Jain).

I would like to thank Jatin Yadav and Arjun Arul 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

Participants will have 3 hours to solve 7-8 problems. The scoring will be ICPC style. Contest will be rated for everyone!

Good luck everyone! Hope to see you on the leaderboard.


Hope to remain at least 4* this Contest

Two rated contest on codechef on the same day. Nice :slightly_smiling_face:


Now even if you screw the first one, you can do a comeback with the second :grin:


Or screw it again XP


I wonder in which order rating will be calculated for long, cookoff and icm.

1 Like

Well, it’s better to regret something you did rather than regret not doing anything :wink:


“MARATHON”-3 hrs

Hey guys, can you please explain why did the 3rd problem was deleted in last year’s contest? I mean what went wrong?

It is a global coding marathon. But 95% programmer are from india.:grin:


Every rating change takes place with respect to the initial ratings so for all these contests would the base rating be our current rating ?

Nice :ok_hand:t2: The Problems were interesting, btw how did you guys do 4th One? :thinking:

ig the constraints were wrong

Which question you are taking about?

I applied binary search on the answer. Here is my code.
Btw, how did you solved the 3rd one? What was your thought process in that?

the jee one

I could not solve the 4th one. how did you solve it? any idea?

Diffrentiate it by hand first. Set min to and max to pi/2. Do binary search, if slope is negative, go ahead, if slope is positive go behind. Then compute the value for f(x)

1 Like

How to solve Third question.?
Are These Equal

For “Are these equal”

I checked two things

  1. The sum of elements must be a multiple of k

  2. The minimum no of operations would be equal to maximum element in array and The maximum operations would be simply sum//k
    Then i just checked if minimum is less than or equal to maximum value.

I just checked these two condition for Output

        int n,k;
        int a[n];
        for(int i=0;i<n;i++)
            cin >> a[i];
        int sum = accumulate(a,a+n,0);
        int maxi=a[n-1];
        int temp=sum/k;
        if(sum%k==0 && temp>=maxi)
            cout << "YES" << endl;
            cout << "NO" << endl;
1 Like