shubham6105's blog

CodeChef Starters 171 (Rated upto 5 stars) — Advitiya '25 IIT Ropar | 29th Jan
By shubham6105, 2 days ago, In English

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


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

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

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

→ Reply
»
2 days ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
  • »
    »
    2 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Since it's a part of our college fest, you won't be eligible for round 2, though you can give online round 1 if you want.

    → Reply
»
27 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Reminder: The contest will start in ~20min.

→ Reply
»
27 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
27 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

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.

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

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

    → Reply
    • »
      »
      »
      25 hours ago, # ^ |
      ← Rev. 4   Vote: I like it 0 Vote: I do not like it

      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 ?

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

        Swish Game?

        → Reply
      • »
        »
        »
        »
        25 hours ago, # ^ |
        ← Rev. 3   Vote: I like it 0 Vote: I do not like it

        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.

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

          Oh, so the game wouldn't start if N=3. You're right. Thanks and apologies.

          → Reply
»
25 hours ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

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

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

    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

    → Reply
»
25 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

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
→ Reply
  • »
    »
    24 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    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

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

      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.

      → Reply
»
24 hours ago, # |
  Vote: I like it +1 Vote: I do not like it

Tough contest btw

→ Reply
»
24 hours ago, # |
← Rev. 2   Vote: I like it +4 Vote: I do not like it

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

→ Reply
»
2 hours ago, # |
  Vote: I like it +1 Vote: I do not like it

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

→ Reply
»
66 minutes ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply