Likes in Posts and Comments

Hello.

Here's a small improvement for posts and comments. Likes can now be specified in their markup. Maybe this will be useful for organizing some kind of polls or collecting feedback.

Here are some examples:

Yes, I know that this feature can be improved. I would prefer that we try to use it a little and understand what exactly is missing the most. Maybe we need to implement the fully functional polls.

Let's do a small survey using the new feature.

1. What is your age range?

   • under 16:

     696

   • 16-20:

     2802

   • 21-25:

     1715

   • 26-35:

     226

   • 36+:

     56

2. Tabs or spaces?

   • tabs:

     3634

   • spaces:

     840

3. Have you had covid??

   • yes:

     963

   • no:

     3210

   • I don't know:

     665

4. Lately, there have been a lot of meaningless blogs on Codeforces. Is it worth strengthening measures to fight against them?

   • yes definitely:

     1044

   • rather yes, but not necessarily:

     2518

   • rather no, I read some of them:

     326

   • no definitely:

     128

• 16 months ago, # ^ | ← Rev. 2 →   +31 Fixed. Do you like the changes? 595

• 16 months ago, # ^ | So much support for a list/catalog/wiki of tutorial blogs. Only a few days ago I found out that I had missed an interesting blog about convolutions because I happened to not check the blogs during the 24 or so hours this blog was in Recent Actions. It would be awesome if I could just open the list of tutorial blogs and start reading up on the first thing I don't know. Also as someone who sometimes writes educational blogs it's kinda demotivating to see my blog just disappear into the void after it gets buried under "please debug my code", "rule about third-party code is changing", announcements of old rounds and "someone cheated on Telegram". The only issue is preventing this place from being overrun with spam and low-quality tutorials. My suggestion is to simply allow only masters and above (or whatever rating limit feels appropriate) to add blogs to such a page.

  • 16 months ago, # ^ | I've been facing these issues myself as well. You need to constantly monitor recent actions for high quality blogs, lest it gets flooded with spam blogs. The main issue seems to be the fact that "blogs" being the only top-level communication unit forces them to perform all sorts of functions, and useful stuff for some purposes is just spam for other purposes. Adding a page with links to good tutorial blogs would definitely be a good idea (and it would be great if it could be kept persistent with all history rather than just a sliding window like recent actions). Perhaps this can be done as a separate section on the EDU page as well, idk.

• 16 months ago, # ^ | I don't see internet points increasing, I upvote.

• 16 months ago, # ^ | Forgiving my dark mind, I laughed so hard every time seeing "orz Mike" xD

• 16 months ago, # ^ | There's a bit of a bug: when I revert to previous revisions and back to current, the markup doesn't work anymore.

• 16 months ago, # ^ | I am actually not sure what exactly is asked there. Auto-replacing tabs with spaces is more or less a standard practice, so which of the two is this?

• 16 months ago, # ^ | Could be possible that multiple people may have pressed it concurrently. 17

• 16 months ago, # ^ | i Liked Them all :_:

  • 16 months ago, # ^ | ← Rev. 2 →   0 You can like all options

• 16 months ago, # ^ | ← Rev. 4 →   +12 Late editorial after contest: 3 Fast editorial after contest: 15 Editorial during contest: 8 Editorial before contest: 138

• 16 months ago, # ^ | omk orz

• 16 months ago, # ^ | When I voted Yes, it automatically voted No. Maybe I am having a great&bad day in the same time.

  • 16 months ago, # ^ | Yeah because i didnt use widget where both have differnt groups. Dont take it personally :-:

• 16 months ago, # ^ | Are you surprised to know that BIT can be used for arbitrary RMQ not only prefix? I really wonder how to solve it. May you tell me? Thanks in advance.

  • 16 months ago, # ^ | ← Rev. 3 →   +9 http://ioinformatics.org/oi/pdf/v9_2015_39_44.pdf I already implemented query in logn and update in log^2 n but I didn't implement update in logn successfully until now :(

    • 16 months ago, # ^ | ← Rev. 4 →   +5 and the query is 4X times faster than recursive segment tree and as fast as iterative segment tree but I think its easier to implement but there is no use of that when I can't implement the logn update (because I am noob) if any one can share his implement I will be thankfull :)

    • 16 months ago, # ^ | ← Rev. 2 →   0 I try implementing the RMQ BIT (queries and updates in $$$O(\log N)$$$) though I am not sure if my implementation is fully correct. I have tried it on the following problems and it seems to be working fine.

      • 16 months ago, # ^ | Your code is not logN update. You can see that easily as you have two nested loop any of them have logN complexity. I tried these problems already when I was trying to implement and get AC but wasn't able to persuade my self so I generated alot of random tests and compare BIT code with a recursive segment tree. And the res is the query operations is so fast around 4X times faster than segment tree but update is so slow as its make 10X time than segment tree there can be two reasons that we didn't see the diffrence in these problems. Not provided a test with alot of update query. Provided a test like that but small const factor and a fast query cover that.

        • 16 months ago, # ^ | ← Rev. 2 →   +5 You can see that easily as you have two nested loop any of them have logN complexity. But the inner for loop is not reset on every iteration of the outer for loop (the pointer i and j can only go up in the tree), so it should be $$$O(\log N)$$$ right? Similiar to how two pointer is $$$O(N)$$$. for (int i = 0, j = 0; i < n; ++i) { while (j <= i && ...) { ++j; } ... }

          • 16 months ago, # ^ | Oh I am wrong. Yes Yes, you are right I miss read the position of j=p-1 I thought it was in the increment part but I notice now that it is in the initialization part. Thanks for the implementation I will revise it carefully now :")

• 16 months ago, # ^ | Are you surprised to know that BIT can be used for arbitrary RMQ not only prefix? This is not so surprising if you consider what segments a BIT maintains. A BIT maintains the solid segments on the right while it is "missing" the dotted segments (that do appear in the segment tree). Notice that the missing segments are exactly the ones you would get if you added another BIT on the reversed array. So it seems intuitive because with two BITs, you at least have the necessary information to answer range minimum queries. And from this image it's also not hard to derive how to answer the queries. You jump left on the normal BIT and jump right on the reversed BIT until you meet. This visits essentially the same things as an iterative segment tree, so a similar constant is also plausible.

  • 16 months ago, # ^ | That what I was able to do. the all problem is update query which my implementation wasn't run corectly so I can only use two get min query on every node two update it with total (logn node)*(logn query for each node) =log^2(n) I undrestanded the update process corectly but I wasn't able to implement it sadly :(

• 16 months ago, # ^ | Are you surprised to know that BIT can be used for arbitrary RMQ not only prefix? For minimum query on prefix, is it possible to perform updates using arbitrary values?

  • 16 months ago, # ^ | Yes, and not only for RMQ on prefix but also for arbitrary RMQ

    • 16 months ago, # ^ | Could you explain how? From what I've read from cp-algorithms, we can only do the update if the new value is not greater than the current value.

• 16 months ago, # ^ | ← Rev. 2 →   +57 A tab could be a different number of columns depending on your environment, but a space is always one column. Exactly. If someone prefers 4 space and you prefer 2, when they use tab you both can see the code in own preferred way. With space you don't have that option. That may be the reason many people prefers tabs.

  • 16 months ago, # ^ | What if you're looking at code on someone else's screen?

• 16 months ago, # ^ | ← Rev. 6 →   +2 QAQ 5 QwQ 2 OvO 2 (>_<) 46

  • 16 months ago, # ^ | Use [] in place of ()

    • 16 months ago, # ^ | Thanks! 14

    • 16 months ago, # ^ | [>_<]

• 16 months ago, # ^ | If you like one you will like all of them. Use it correctly.