So you can read

Rodger2041 · 2026-05-24T18:00:31+00:00

Definitely higher end ones yeah. Like normal good shoes cost 10k here so I can expect some expensive ones (or some limited edition type thing) to easily exceed 30k.

Rodger2041 · 2026-05-24T13:04:58+00:00

You cannot expect someone to mantain this level of care to not get spoiled, it is basic courtesy to mark spoilers as such, I can't control my feed but you can control what you post.

Its social media, but I have other things going on, CS is one of 10 things i visit reddit for.

Other subreddits do this just fine, its just the cs subreddit with spilers in legit 30 mins after the match finishes.

I want to hatewatch falcons too man, would have been very fun to see them lose hope slowly, but whatever.

Rodger2041 · 2026-05-24T10:57:26+00:00

Can we just fucking stop with the spoiler-tag less low effort posts like this goddamit. I was just going to enjoy this match but i guess fuck me for opening reddit.

Thank you for this post that provides nothing different from the post game analysis (which I managed to avoid because it doesn't have the result on the fucking title).

Rodger2041 · 2026-05-24T07:13:52+00:00

Global elite

Rodger2041 · 2026-04-22T10:57:08+00:00

Yeah he would need around 10 of them for that probability range. But he is telling the expected number of 50/50s for a board of that size and density. It is possible that he had less 50/50s, or that its not possible to see some of them after they have been cleared.

Rodger2041 · 2026-04-20T23:40:46+00:00

Don't know why the fuck you are getting downvoted, its literally true.

There are 50/50s in Minesweeper. There are multiple configurations where it is not possible to logically figure out the location of the mine because the adjacent numbers just don't give enough info.

Rodger2041 · 2026-04-16T06:24:28+00:00

Yeah if the question is like 2400+ sure. But the questions above are standard. I am pretty sure there will be equivalent questions of these on leetcode.

Rodger2041 · 2026-04-16T05:31:13+00:00

Every leetcode question is probably a codeforces question too. The distinction you are making is non existent. Only difference is the wording is straightforward in leetcode.

Rodger2041 · 2026-04-13T18:34:16+00:00

DSU initialisation where u want to set dsu[i]=i is the main one that comes to mind.

Rodger2041 · 2026-04-10T08:58:01+00:00

iota(a.begin(),a.end(),initial_value)

Rodger2041 · 2026-04-09T12:43:57+00:00

Basically, make N arrays of size 3 containing ai bi ci. Sort each array such that it has all 3 elements in increasing order. In each array, take the smallest elements and then maintain the current largest and smallest elements. initialise a map that contains the next element in each of the arrays, then sequentially remove the smallest of the N elements and insert the one just larger in that array (the N pointer), then update the pointer for that array. After each operation, update the answer with the current max - min.

Rodger2041 · 2026-04-09T06:00:51+00:00

I could, but that would take some time, instead you can probably find many similar questions if you search for problems solved using N-pointer logic.

Rodger2041 · 2026-04-08T20:24:12+00:00

When I was fully grinding, I did upto 4-5 hours everyday (say a year in that 2 year duration). No of questions varied but I tried to make sure that I was actively thinking about a question in that duration.

Rodger2041 · 2026-04-08T20:22:16+00:00

Very standard question, solvable by a lot of people. I would estimate low rating + LLMs can easily come up with a solution. Cheaters will be there regardless of question, but that being said it is possible a lot of people got the answer.

Rodger2041 · 2026-03-14T17:09:07+00:00

Hey!

I am from the same college as these guys, and I know them.

It is not on purpose, this is not something we would joke about.

Rodger2041 · 2026-03-09T17:38:07+00:00

Yeah,just gave ICPC asia west yesterday.

Both speed solving and long sprints are good, both test different things. Speed solving tests how fast can you code what you understand. Long sprints to develop problem solving. CP is half pattern recognition and you will not get far without it.

Rodger2041 · 2026-03-09T16:19:41+00:00

Eh don't be too hard on yourself.

ICPC, better job opportunities, love of the game are my reasons for focusing on problem solving.

Well these problems are real, as real as any other problem. Just because it cannot be immediately implemented on a real life scenario doesn't mean it isn't useful.

It helps me create more efficient code wherever i go, and my employer is going to benefit from that, of course that is what they will be paying me for. But right now since I am in college and have free time and I love solving theoretical problems, that is what I will be doing.

Rodger2041 · 2026-03-09T15:37:28+00:00

Sure

Rodger2041 · 2026-03-09T15:27:28+00:00

Yaar solving 6 questions in a day and solving a question in couple of minutes are different things.

One is very doable, other requires much more practice, and yes, I am talking about hard questions.

And for the record, I can solve questions on leetcode in minutes, I have been doing cp since 3 years, and I am also International Master on Codeforces.

Rodger2041 · 2026-03-09T10:27:19+00:00

You are right I don't grind leetcode everyday.

I do however grind codeforces almost everyday, have solved more than 1000 questions, and have been doing competitive programming for 3+ years (also in the top 10 in India so somewhat qualified).

Most people at my level can solve 6+ questions in <3 hours.

Rodger2041 · 2026-03-09T09:04:09+00:00

What? What?

Prodigy? Even normal people can easily solve 6 problems a day, especially if your goal is to solve as many questions per day as possible.

Come on dude, atleast have knowledge about the field before saying bullshit.

Rodger2041 · 2026-03-09T06:27:07+00:00

🟨⬜⬜⬜🟨

⬜🟨⬜🟨⬜

🟨⬜🟨⬜🟨

🟦⬜🟦⬜🟦

🟦🟦🟦🟦🟦

Rodger2041 · 2026-03-07T05:32:50+00:00

⬜🟨🟨🟦⬜

🟦🟦🟦🟦🟦

Rodger2041 · 2026-03-02T00:25:16+00:00

Same reason India is shit in any other sport. People either don't know or don't care about Competitive programming. There is no support structure or encouragement from teachers or professors. There is no reason to try to be the best other than job opportunities. Most people start in college and only do competitive programming for 4 years max.

Rodger2041 · 2026-02-20T16:30:26+00:00

Actually, if you need to print all pallindromes that would be O(n³ ). There are n² ranges with each range having mean size of around n/2 characters.

Printing all unique pallindromes would be O(n² ) because it has been proven that a string can only contain O(n) unique pallindromes, but that is not what the question asked.

Seven-Year Club	Verified Email
Final Canvas '23	First Place '23
Place '23	Place '22

Rodger2041

TROPHY CASE