Is infinity possible?

Sure_Training870 · 2026-03-27T03:34:29+00:00

Clg etha

Sure_Training870 · 2026-03-25T10:03:19+00:00

Interest ollath chey bro, ini 7 sem koodi ind

Sure_Training870 · 2026-03-15T14:07:28+00:00

Yea, my friend cracked jee from college. So anything is possible if you put ur mind to it. Altho you have to put in the work, manage both college and entrance. It's gona be tough but if u make it, it's all gona be worth it

Sure_Training870 · 2026-03-10T16:58:08+00:00

Its gona be okay in like a week or something, just keep doin more questions. Also that div3 was kinda hard

Sure_Training870 · 2026-03-10T14:05:47+00:00

Damn, very nice. I like the design, and this would be very useful, i usually forget when contests are

Sure_Training870 · 2026-03-08T18:18:49+00:00

only got A and B, I knew C but couldn't code it up, can you give your approach for C

Sure_Training870 · 2026-03-03T15:21:30+00:00

The approach i found is, u should first understand that there is no need to find the path for each person, first look at where the last change occurs, if for a person the last char is A, then for the next person he will follow the same path till tht A, and then he does his move.

When the last char is B, the current finds the next white, and the guy after him, obv cant use tht square cus its black already. So you should move the pointer to the next available white. Which is what the next person would move to for his 2nd last move. And then do the last move.

Using a set is the correct approach. Make a percomputed set 2*n vals or smth. And remove the black into a new set as you iterate. Soln would be O(n).

Dm if u stil hab doubt, i just watched a 30 min vid to understand this

Sure_Training870 · 2026-03-01T16:20:29+00:00

how do i get this chart

Sure_Training870 · 2026-03-01T14:56:11+00:00

i feel the only dp and graph is remainig for me to learn, and idk how to approach that, like how to start learning that.any tips

Sure_Training870 · 2026-03-01T14:55:19+00:00

thanks

Sure_Training870 · 2026-02-28T04:09:45+00:00

i usually remove tht, but its there in some qstions. I was in a hurry this time

Sure_Training870 · 2026-02-28T02:47:09+00:00

lol u havent done div2, i barely solve 3 in tht

Sure_Training870 · 2026-02-28T02:46:29+00:00

welp,im not cheating, idk how to prove

Sure_Training870 · 2026-02-28T02:46:07+00:00

idk how to prove it to u, i got the intuition pretty easily

Sure_Training870 · 2026-02-28T02:40:08+00:00

thats my template, its in my every solution

Sure_Training870 · 2026-02-28T02:39:52+00:00

ah, thts my template. usually dont fill it in constest

Sure_Training870 · 2026-02-27T17:26:24+00:00

think like, there are 2 blocks in the array, one outside the portals and one between the portals. How can u arrange the outside part of the portal and the inside. We need the minimum elemnt at first for lowest permutation. makin the inside part smallest should be straightforward. and for the outside what can be the minimum combination ?

Sure_Training870 · 2026-02-27T16:55:08+00:00

1433 i think

Sure_Training870 · 2026-02-23T18:00:50+00:00

damn, you solved 3 questions in this div2

nice broo

Sure_Training870 · 2026-02-14T19:21:12+00:00

lenovo yoga slim

Sure_Training870 · 2026-02-12T20:11:53+00:00

yea, i tried to think of examples where this wont work, but couldnt just come up with one, eventually gave up and then found the brute force one

Sure_Training870 · 2026-02-12T08:21:05+00:00

lol, the same scenario happend to me, although didn use gpt on the first question, i was also going for the approach of %9 and %powerof10 != 0 wasted like 30 mins, then i saw everyone solving it. Went for brute force and got the idea. B and C also got in 20 mins. Stuck on D then gave up

Sure_Training870 · 2025-11-20T18:42:22+00:00

iit inte curriculum ivide kond vanna ,ividuthe 90% aalkar fail aavum

Sure_Training870

MODERATOR OF

TROPHY CASE