When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

new2022's blog

By new2022, history, 2 years ago, In English

Hello Everyone!
We would like to invite you all to participate in the SPYBITS2022 CONTEST-1 aka the Spybits Number Theory Contest, under the banner of Udyam'22, IIT (BHU) Varanasi. The contest will be held on 28th Jan 2022 at 20:00 IST.

Udyam is the annual technical fest of the Department of Electronics Engineering, Indian Institute of Technology (BHU),Varanasi. To know more about Udyam, please visit the official website of Udyam'22.

Spybits Number Theory Contest is the first round of the SPYBITS event, in which your Number Theory knowledge is tested along with your programming skills. This contest is open to everyone, so you can appear in the contest even if you haven't registered for the SPYBITS event.

All the problems have been prepared by XORring-Samurai, Lazy_Propagater and me, new2022.

We would like to thank sudoSieg and adikrsingh for testing all the problems.

You will get 2 hours 2 hours and 15 minutes to solve 7 problems, all the problems will be majorly based on number theory. The scoring will be of ICPC style, you can learn more about it from the contest page.

I hope you guys will like the problems, Good Luck everyone!

P.S.

In the 'Upcoming Coding contests' section of Codechef, you can see a contest with code SNTC2021 (if you mark 'show all contests') scheduled on 31st May 2022, kindly ignore it for the time being, it is the consequence of a mess created by me, we will see how to fix it later.
Thank You.

Edit

We have decided to increase the contest duration by 15 minutes. Now you will get 2 hours and 15 minutes to solve 7 problems.

  • Vote: I like it
  • +85
  • Vote: I do not like it

| Write comment?
»
2 years ago, # |
  Vote: I like it +29 Vote: I do not like it

Why no prizes :(

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by new2022 (previous revision, new revision, compare).

»
2 years ago, # |
  Vote: I like it +6 Vote: I do not like it

In Fastest Divison Problem, shouldn't the answer of testcase n = 3, a = [2,4,8] be 2 instead of 3. First divide by 4, then by 2.

  • »
    »
    2 years ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    Yeah, you are right i think there is a mistake in the intended solution, i am extremely sorry about this. I will se what i can do about this.

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve the problem "Sum of Product (Easy Version)"?