Блог пользователя shubham6105

Автор shubham6105, 2 дня назад, По-английски

Invitation to CodeChef Starters 171 (Rated upto 5 stars) | 29th Jan

We invite you to participate in CodeChef’s Starters 171, this Wednesday, 29th January, rated upto 5 stars (i.e. for users with rating < 2200).

Time: 8:00 PM — 10:00 PM IST

Joining us on the problem setting panel are:

Written editorials will be available for all on discuss.codechef.com. Pro users can find the editorials directly on the problem pages after the contest. The video editorials of the problems will be available only to Pro users.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here. Hope to see you participating.

Good Luck!

Organized by Coding Club, IIT Ropar


Advitiya' 25: Annual Tech Fest of IIT Ropar

Join us for an exciting journey of innovation, learning, and fun at Advitiya 2025, scheduled from 7th to 9th February. Experience a wide range of activities, including competitions, exhibitions, workshops, and activity zones. Best of all, registration and accommodation are absolutely free!

Contact us: +91 9310813442 | +91 82669 56557

Advitiya' 25 Register



  • Проголосовать: нравится
  • +37
  • Проголосовать: не нравится

»
2 дня назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

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

»
2 дня назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Why are Indian School Students not allowed for some of the competitions like AlgoUnlock?

»
27 часов назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Reminder: The contest will start in ~20min.

»
27 часов назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Five minutes passed but still no statement has loaded on my pc. My net issue or codechef server issue??

»
27 часов назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

how reasonable is it to just assume that we should have $$$K <= N$$$ in problem A. Weird, but maybe I am completely misunderstanding the statement but I needed this $$$K <= N$$$ thing to get AC.

  • »
    »
    25 часов назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    Strange, didn't know number of players getting eliminated could be more than there were already!!

    • »
      »
      »
      25 часов назад, # ^ |
      Rev. 4   Проголосовать: нравится 0 Проголосовать: не нравится

      I meant div2 A Swish Game.
      And as I said, maybe I am misunderstanding the statement. But, in first sample, what is wrong with N = 3 being an answer ?

      • »
        »
        »
        »
        25 часов назад, # ^ |
          Проголосовать: нравится 0 Проголосовать: не нравится

        Swish Game?

      • »
        »
        »
        »
        25 часов назад, # ^ |
        Rev. 3   Проголосовать: нравится 0 Проголосовать: не нравится

        I think so the problem is quite intuitive. Think as -

        statement crux

        so we can see that game has ended but he hasn't been able to capture 4 rings, thus we say now he can't capture any more too. So find suitable n.

        For n = 3 the game would have ended without string as k = 4 which isn't possible.

»
25 часов назад, # |
Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится

Can anyone please tell how to check no. of redundant string.

  • »
    »
    25 часов назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    no of strings respecting the constraints in both direction — no of strings that respect the constraints and are palindromes gives you the number of string that could be met both ways.

    Half of them will be redundant

»
25 часов назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

In problem D, it is counting the number of distinct pairs like [a,b,c,d] and [d,c,b,a] then if any pair is pairwise distinct then inner values can be anything but if same then inner values have to compute 2 cases. If this is the solution, I am getting WA on the last test case.

solve function
  • »
    »
    24 часа назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    it is not true that x/2 % MOD == (x%MOD)/2 !

    try setting mod to 2 000 000 014 and outputting your answer % mod/2

    • »
      »
      »
      24 часа назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      Wait wait. A value like $$$15$$$ can be represented like $$$((5 * 6)/2)\mod M$$$ what's wrong in this. Ultimately it's getting multiplied by 15 and no division inverse thingy can impact this.

»
24 часа назад, # |
  Проголосовать: нравится +1 Проголосовать: не нравится

Tough contest btw

»
24 часа назад, # |
Rev. 2   Проголосовать: нравится +4 Проголосовать: не нравится

i was unable to solve even two question of div2 in first hour of the contest,luckily i ended up solving 4 questions btw nice div2 C and D

»
2 часа назад, # |
  Проголосовать: нравится +1 Проголосовать: не нравится

Even though it wasn't rated for me, my rating dropped.

»
64 минуты назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

The contest was rated till 5 stars only,you changed the rating of 2200+ as well.Please check this.