GetRekt's blog

By GetRekt, 38 hours ago, In English

Hello, Codeforces!

We're delighted to invite you to NITS HACKS 7.0 Coding Track Finals Mirror Contest (Unrated, ICPC Rules, Teams Preferred) on Nov/12/2024 18:30 (Moscow time). NITS HACKS is an annual event brought to you by Coding Club NIT Silchar, in association with the grand tech fest Tecnoesis, of NIT Silchar.

The problems were written and prepared by sroid_03, Amartya3, sohailkazi, and me (GetRekt).

I would also like to thank EyadBT, Peter-007 and AyuAnchor for testing and their valuable feedback.

The duration will be 3 hours. You can register individually, but teams are preferred. You may code parallelly with several computers with your teammates and use prewritten codes and templates.

Contest Link

We've put great effort into preparing this contest and hope you will enjoy it. The registrations have begun.

Good luck, have fun!

Congratulations to the top 3 winning teams of the official contest!

DistortedPrimes: (decltype_t, AbeedShaik)

SubtasksWhere: (SmolBrain, shiven, hariaakash646)

whitepilled again: (shlokagrawal, Final_Track, unalive)

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

»
28 hours ago, # |
Rev. 3   Vote: I like it +8 Vote: I do not like it

Are we allowed to discuss the problems now? I am able to do E1 but how to optimize for E2? Also, what's the logic behind C? Doesn't seem like a predictable series!

  • »
    »
    14 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You can use FFT for E2 and some continued fractions or rational approximation to find the number of points under the line in C.

    • »
      »
      »
      6 hours ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      FFT was giving TLE, then switched it with NTT

    • »
      »
      »
      75 minutes ago, # ^ |
      Rev. 2   Vote: I like it 0 Vote: I do not like it

      Thanks for the help. C is still not clear. Would you mind sharing your logic here or via personal message? We aren't able to see other accepted solutions for this contest.