| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
|
+1
|
|
0
Could you please send that to me as well? The aforementioned one is expired indeed. |
|
+1
Had same issues yesterday and today when used saved link, which was www.codeforces.com. Without www. it seems to work. |
|
+71
Fun fact: some time ago I was invited to make a number of videolectures of a similar kind (just like the one on cartesian trees, but dedicated to other topics) for a certain customer. At that time, I thoroughly recorded my labor costs, and it turned out making even single lecture takes a tremendous amount of man-hours. For example, a lecture on C++ sequential data structures, consisting of 9 parts with a total duration about 140 minutes, took more than 90 hours to make — ~27 hours to create slides, ~22 hours to write a script, ~9 hours to actually record and terrifying ~34 hours to edit a video. Thus, the $1000 reward may seem huge, but if we divide it by 90 hours, we'll get less than $12/hour (which, on the one hand, is still quite a lot compared to typical Russian universities teachers' reward, but, on the other hand, leaves much to be desired compared to the wages in other countries and types of work). And if someone is wondering why does it take so long, I'll hide my thoughts on that under the spoiler, since I don't want to impose them. Long story short — I think we have a golden standard for videos of this kind, which is 3Blue1Brown's works (and, to continue the list, Reducible and Primer are pretty close). Among the algorithms and programming courses, I think the best I've seen is the Sedgewick's one (and believe me, I've seen a lot). I am quite sure that creating of pashka's Codeforces.EDU lecture takes longer than Summer School lecture, and creating of Princeton's lecture or peltorator's video takes longer than Codeforces.EDU lecture (I'll bet that latter ones take no less time than I stated earlier). I believe that the video lectures should be somewhat more than just recordings of typical university classes. I think that the video should not contain:
I think that the video should contain:
|
|
+12
I have certain troubles with logging in Web Arena now. First I see this login form
, where I type my login and password. This authentificates me at TopCoder site. Then I see a second form
, which keeps telling me that either username or password is wrong. But I can successfully log in to Applet Arena with those. Both "register" and "reset password" links lead nowhere. UPD: And when I'm trying to open arena.topcoder.com after log in topcoder.com site, it results in an infinite loop striving to load https://accounts-auth0.topcoder.com/?retUrl=https:%2F%2Farena.topcoder.com%2Findex.html |
|
0
Oh, thank you. Apparently, one of my browser extensions blocked these stars for some reason, so the standings page looked like this
. to me. Now I've disabled the extension and the stars are back. Thank you again. |
|
0
My question was about editing that list, i. e. how to add a new user to it. |
|
0
Is there still an opportunity to somehow edit the list of users one's following? If I remember correctly, there was a star-like button in standings, but now I see no things like that. |
|
0
I did the same for the same reason, now the 2021 t-shirt has already been delivered (to Europe). |
|
+1
|
|
0
...Or you could generate random maxtests to check wheither your solution processes them reasonably fast and then notice that the answer overflows. That was precisely my case with that problem. And, by the way, "always do not forget to test wheither maxtest processing fits in time limit" was my takeaway from another failed round (it's highly possible that was a FHC round). |
|
+6
In problems with multitests one may not return from solve function until all input is read. |
|
+7
Opened 250: HOLY CRAP just look at this gorgeous WALL OF TEXT on an one-hour contest! TL;DR: okay, we have rock-scissors-paper, we know nothing about what is where, and further it all would be shuffled in two different ways, uh-huh, and we just need to correctly guess which beats which... almost everytime, hm. Yes, I know precisely what to do with this problem (*Closes 250). Opened 600: Yeah, this one definitely seems more doable. (*Spends 1h on Kosaraju, condensations and stuff only to conclude there are no viable ideas left.) Reopened 250: Okay, we have about 10 more minutes to go, sure it is pretty enough time to submit some YOBA solutions on this one. (*Writes 10 lines, the solution passes samples... and systests) YOU GOTTA BE KIDDI |
|
+3
I suggest you to sort problems by difficulty. Problem letters are almost always meaningless. |
|
0
|
|
+15
http://mirror.codeforces.com/contest/561/problem/A http://mirror.codeforces.com/contest/561/problem/B The amateur translation for questions from problem A:
|
|
+6
I suppose this paper would be useful for you. |
|
0
But if we use x=310=112 which fits in 2 bits, we will get x2=910=10012, which doesn't feet in 3 bits.
|
| Name |
|---|


