Hey Everyone!

This is something I observed while practicing problems according to tags. When you select multiple tags in problemset filter, it'll show you problems which contains all of the tags selected. Basically it kind of do an intersection operation and show problems having all the tags mentioned present.

Wouldn't it be great, if rather than showing the problems with all the tags mentioned, it would show problems with union of mentioned tags, which means all the problems which have at least one tag mentioned in the filter will appear.

What do you people think?

UPDATE : You can find a tag "combine tags by OR" in the tags itself. Thanks to Mahog

Here's an example of what happens now,

I didn't find any info. regarding this, so posting this blog.

The contest dates are February 22, 2023 — February 22, 2023, while the registrations are open between February 16, 2023 — March 08, 2023.

Is it some sort of mistake?

Hey Everyone.

I have been working on CF Edu Section Binary Search Playlist, which will consist of total 22 videos for each problem.

Actually, when I started solving the Edu Section Binary Search topic, I was unable to find videos for many of it's problems on YouTube and got stuck for quite some time. Since then I had this thought of making the whole playlist myself. So, I started making the solution videos for the Binary Search topic practice problems, and currently I have posted 7 videos in the playlist, including 4 videos for Step 1, and 3 videos for Step 2.

The reason for writing down this blog is to get some feedback from the CF community on the videos I made, so that I can do any required changes or rectify any unintended issue, in the upcoming videos for the playlist.

I hope you people will find this playlist helpful.

Link to the Playlist : CF Edu Section Binary Search Playlist

P.S. : I'm new to YT and making videos, so pardon me for any pronunciation or Naïve technical mistakes. I'll surely try to rectify them in the future.

Namaste Everyone! A very Happy New Year to everyone in advance :) Hope you're enjoying this time.

I was checking a problem's tag in Chrome's incognito mode, when I saw a gap in my profile (in the heat map) and I wasn't logged in at that time.

I got a bit scared, as I'm maintaining streak for some time and want to carry it on for at least an year. I solved one question on that date as well. See, it's showing "134 days in a row max".

I refreshed the screen some times, cleared cache of my browser, checked again (but this time logged in), and everything was normal, with no gap. See, it's showing "138 days in a row max".

I blamed it on cookies then, or some other technicality (my noob assumption)...

But, later I again checked without logging into Cf, & again it showed that gap.

Although, now I'm somewhat satisfied, as it's not showing it in my actual streak (You can see in the 2nd image above, with a total of 138 days in a row max.), yet I'm a bit curious, why it's showing that gap in my profile when I'm not logged in into Cf.

Note : That gap date is 28/12/2022, and I solved just 1 problem that day.

I was searching for this question, but didn't find it anywhere. I was wondering that some contests with a minor hardness deflection in like Problem C & D is justifiable (where D is easier than C), but some contests literally have a big difference of hardness, yet they're assigned like that in a contest.

Some ex. of such Contests are :

Educational Codeforces Round 140

Codeforces Round 830

Codeforces Round 823

Codeforces Round 805

Codeforces Round 770

etc.

I was going through this blog to know, how ratings are assigned for problems in Codeforces, and broadly it's quite related to how many submission a problem is having with participants of various ratings.

Although, such contests, as mentioned above, are really very few if we see overall contests, yet out of curiosity I was thinking, don't they affect the rating of a problem actually? Because, if let's say C is harder than D, then a lot of people will spend more time on C & probability of solving D will decrease because of that, which will lead to an increased rating assignment to it, when it might not be even worth the rating.

So, my question is, is there an explicit check for such scenarios to rectify the actual rating accordingly and, why do problem setters decides to assign problem in such sequence, is it coincidental or intentional? Because with minor difference, it's understandable, but I don't think it's coincidental, when that difference is quite considerable.

In recent Codeforces round #831, I got TLE in the final Test Set (Pretests passed successfully) of Problem B for this submission

I then again submitted this exact same solution but replacing >= with > in my cmp function and it got accepted. Accepted Solution.

I'm unable to understand why I got TLE in my original solution. Please help me with this.

In the AtCoder Beginner Contest 271, I made two submissions for Problem D.

Submission 1, which is an AC.

Submission 2, which is a WA.

In Submission 1, I declared dp as int dp[101][10001]; globally, and used memset(dp, -1, sizeof(dp)); inside main function. In Submission 2, I declared dp as vector<vector<int>> dp(101, vector<int>(10001, -1)); inside main function, and passed it in function 'f' by reference.

I'm clueless about what is causing this WA in Submission 2, when the logic remains same. Could someone please help me with this.

In the last Educational Codeforces Round 134, I did a submission for Problem B. In this submission, I got a TLE. While this submission got Accepted.

The only difference both of these codes are having, is of the "abs()" function. When I used "abs()" (Although, it was redundant) it gave TLE, no loops nothing. And when I just removed (effectively) "abs()" in it, it got Accepted.

I'm wondering if "abs()" alone can cause this TLE, or there is something, very subtle about it, which was causing it. Please refer to the Links given above for both of my submissions and, in case you want to see it, the problem.

*Edit 1 : Apart from whatever mentioned above, this submission also has a difference of "vector<vector> grd(n, vector(m, 0));" (which again is a redundant thing as per the logic of code)

This doesn't seem to be causing any TLE, or is it?