Можно ввести несколько слов — все они попадут в требования к поиску. Кроме того, осуществляется поиск по словоформам и, если повезет, по синонимам. Поддерживается поиск по названию, автору и специальный синтаксис запросов. Примеры:

  • 305 — ищет все посты, содержащие 305, найдет посты про Раунд 305
  • andrew stankevich contests — можно писать сразу много слов, будут искаться все
  • user:mikemirzayanov title:сазанка — ищет все посты в названии со словом "сазанка" авторства MikeMirzayanov
  • "vk cup" — можно использовать кавычку, чтобы искать точные совпадения
  • title:educational — искать в названии

Результаты

1.
Автор galen_colin, 6 лет назад, По-английски
Hybrid Tutorial #-2: Centroid Decomposition **See the [original post](https://codeforces.me/blog/entry/81317) on Codeforces for a playlist of all similar tutorials and also more information about what this is.** # "Intro" *Timestamp: [00:00](https://youtu.be/-DmMLQCmz94)* This is a "hybrid tutorial" — it has both a blog and a video component. See my original post for more explanation of what this is and also a playlist of all past tutorials. You can view the full video [here](https://youtu.be/-DmMLQCmz94). This tutorial is on centroid decomposition, a cool concept that has many uses in different problems. It's also another "decomposition" technique, one of many. I feel like this subject in particular doesn't have many great tutorials online that really capture the essence of what we do with the technique, so hopefully, I can improve that with this one. # Notation We'll use $0$-indexing for the whole tutorial, and the example problem will also be $0$-indexed. In addition, "vertex" and "node" mean the same...
*Timestamp: [08:14](https://youtu.be/-DmMLQCmz94?t=494)*, ?t=494)* Back to the problem now. When we paint a node $v$ red, to maintain the information we

Полный текст и комментарии »

  • Проголосовать: нравится
  • +264
  • Проголосовать: не нравится

2.
Автор kostka, 12 лет назад, По-английски
Hack me! (Codeforces Round #282 (Div. 1)) Aren't you tired after [contest:494]? **Did you know...** that when you will be on the list of "best hackers" of the round the row with your handle will be highlighted (if you will be logged in)? <center> <img src="http://test.weaselcrow.com/cfhacks/f1.png"> </center> Other posts can be found [here](http://codeforces.me/search?query=hackme), including [div2](http://codeforces.me/blog/entry/15150). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:494A] </small> | 363 (53.23%) | 293 (42.96%)| 26 (3.81%) | 682 | 201 (23.40%) | 658 (76.60%) | 859 | <small> [problem:494B] </small> | 2 (50.00%) | 2 (50.00%)| 0 (0.00%) | 4 | 32 (8.42%) | 348 (91.58%) | 380 | <small> [problem:494C] </small> | 0 | 0 | 0 | 0 | 6 (17.14%) |...
this problem. Check them out: 129139 <> and , | [user:qwerty787788, 2014-12-13] | +5-0 (500) | A: , , 2014-12-13] | +12-2 (1100) | A: 127922 <> , :13:12 | [user:MrDindows,2014-12-13] | [user:unhooked,2014-12-13] | , Aren't you tired after [contest:494]?, Room | #hacks | Hackers | :---:|:---:|:---:| 11 <>| 18 |

Полный текст и комментарии »

  • Проголосовать: нравится
  • +42
  • Проголосовать: не нравится

3.
Автор dacin21, история, 8 лет назад, По-английски
On the mathematics behind rolling hashes and anti-hash tests This blog assumes the reader is familiar with the basic concept of rolling hashes. There are some math-heavy parts, but one can get most of the ideas without understanding every detail. The main focus of this blog is on how to choose the rolling-hash parameters to avoid getting hacked and on how to hack codes with poorly chosen parameters. # Designing hard-to-hack rolling hashes ## Recap on rolling hashes and collisions Recall that a rolling hash has two parameters $(p, a)$ where $p$ is the modulo and $0 \leq a < p$ the base. (We'll see that $p$ should be a big prime and $a$ larger than the size $\left|\Sigma\right|$ of the alphabet.) The hash value of a string $S = s_0 \dots s_{n-1}$ is given by $$ h(S) := \left(\sum\limits_{i=0}^{n-1} a^{n-1-i} s_i\right) \mod p $$ For now, lets consider the simple problem of: given two strings $S, T$ of equal length, decide whether they're equal by comparing their hash values $h(S), h(T)$. Our algorithm declares $S$ and $T$ t...
#494 (problem F). During (and after) the hacking phase I figured out how to hack many solution that, hacking phase of round #494 (problem F). During (and after) the hacking phase I figured out how to

Полный текст и комментарии »

  • Проголосовать: нравится
  • +371
  • Проголосовать: не нравится

4.
Автор vovuh, история, 8 лет назад, перевод, По-русски
Codeforces Round #494 (Div. 3) Editorial [problem:1003A] <spoiler summary="Tutorial"> [tutorial:1003A] </spoiler> <spoiler summary="Solution (Vovuh)"> ~~~~~ #include <bits/stdc++.h> using namespace std; int main() { #ifdef _DEBUG freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); #endif int n; cin >> n; vector<int> cnt(101); for (int i = 0; i < n; ++i) { int x; cin >> x; ++cnt[x]; } cout << *max_element(cnt.begin(), cnt.end()) << endl; return 0; } ~~~~~ </spoiler> [problem:1003B] <spoiler summary="Tutorial"> [tutorial:1003B] </spoiler> <spoiler summary="Solution (Vovuh)"> ~~~~~ #include <bits/stdc++.h> using namespace std; int main() { #ifdef _DEBUG freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); #endif int a, b, x; cin >> a >> b >> x; if (x % 2 == 0) { if (a > b) { for (int i = 0; i < x / 2; ++i) cout << "01"; cout << string(b - x / 2, '1'); cout << string(a...
Codeforces Round #494 (Div. 3) Editorial, Разбор Codeforces Round #494 (Div. 3)

Полный текст и комментарии »

  • Проголосовать: нравится
  • +39
  • Проголосовать: не нравится

5.
Автор vovuh, история, 8 лет назад, По-русски
Codeforces Round #494 (Div. 3) Hello! [contest:1003] will start on [July 3 (Tuesday) at 14:35 (UTC)] (https://www.timeanddate.com/worldclock/fixedtime.html?day=3&month=7&year=2018&hour=17&min=35&sec=0&p1=166). You will be offered 6 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests &mdash; just like you will be upset if many solutions fail after the contest is over. You will be given 6 problems and 2 hours to solve them. [Remember] (/blog/entry/59228) ...
Codeforces Round #494 (Div. 3)

Полный текст и комментарии »

  • Проголосовать: нравится
  • +108
  • Проголосовать: не нравится

6.
Автор kostka, 12 лет назад, По-английски
Hack me! (Codeforces Round #281 (Div. 2)) <s>While waiting for [API](http://codeforces.me/api/contest.hacks?contestId=494) to update,</s> (it has been updated already) let's look at hacks in [contest:493]. That was really good round (even I had some hacks :)). Previous posts can be found [here](http://codeforces.me/search?query=hackme). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:493A] </small> | 18 (22.50%) | 20 (25.00%)| 42 (52.50%) | 80 | 249 (13.16%) | 1643 (86.84%) | 1892 | <small> [problem:493B] </small> | 456 (62.81%) | 178 (24.52%)| 92 (12.67%) | 726 | 509 (29.84%) | 1197 (70.16%) | 1706 | <small> [problem:493C] </small> | 161 (47.35%) | 100 (29.41%)| 79 (23.24%) | 340 | 715 (58.56%) | 506 (41.44%) | 1221 | <small> [problem:493D] </small> | 22 (59.46%...
While waiting for [API](http://codeforces.me/api/contest.hacks?contestId=494) to update,

Полный текст и комментарии »

  • Проголосовать: нравится
  • +36
  • Проголосовать: не нравится

7.
Автор jsgoller1, история, 4 года назад, По-английски
Unnecessary Details: 1B — Spreadsheet [problem:1B] was extremely challenging for me; it took me over 2 hours to get AC. I didn't find the editorial helpful, and then when I went to see practice solutions from red/orange people, it made even less sense (they were basically copy/paste with minor variation of the following): <spoiler summary="Solution"> ~~~~~ #include<cstdio> void g(int t){if(t){g((t-1)/26);putchar(65+(t-1)%26);}} int main(){ int n,x,y; char s[64],*p; for(scanf("%d ",&n);n--;){ gets(s); if(sscanf(s,"%*c%d%*c%d",&x,&y)==2){ g(y); printf("%d\n",x); }else{ for(x=0,p=s;*p>64;++p) x=x*26+*p-64; printf("R%sC%d\n",p,x); } } return 0; } ~~~~~ </spoiler> I'll talk about each part of the problem itself and approaches/alternatives, and then explain how the above solution (henceforth "the solution") handles it. I'll go into unnecessary detail since I'm very new to CP/CF and would've wanted this...
. To make this explicit, we can try doing the normal conversion for decimal 494 , but we don't get the, Now converting 494 works correctly:, To make this explicit, we can try doing the normal conversion for decimal 494, but we don't get the, ``` (12845-1) / 26 = 494 (12845-1) % 26 = 0 // 65 + 0 = 65, 'A' in ASCII (494 -1) / 26, ``` 494 / 26 = 19 494 % 26 = 0 // ?; we have no letter for 0 19 / 26 = 0 19 % 26, ``` 494 / 26 = 19 494 % 26 = 0 // Z 19 - 1 = 18 18 / 26 = 0 18 % 26 = 18 // R

Полный текст и комментарии »

  • Проголосовать: нравится
  • +16
  • Проголосовать: не нравится

8.
Автор kostka, 12 лет назад, По-английски
Hack me! (CF Round #269, Div. 2) Hey there! I am testing some new stuff (according to your suggestions) and playing with matplotlib (learning it to be precise), so here is a bunch of statistics (only) in some past contest ([contest:471]). Previous posts can be found [here](http://codeforces.me/search?query=hackme). [cut] <h3>Stats</h3> By "rejected solutions" we understand solutions, which didn't pass the final tests (and were tested on them). Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other | Sum | <small>Rejected solutions</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:471A] </small> | 401 (55.08%) | 289 (39.70%)| 38 (5.22%) | 728 | 514 (18.02%) | 2338 (81.98%) | 2852 | <small> [problem:471B] </small> | 10 (13.16%) | 60 (78.95%)| 6 (7.89%) | 76 | 204 (10.01%) | 1834 (89.99%) | 2038 | <small> [problem:471C] </small> | 2 (6.06%) | 29 (87.88%)| 2 (6.06%) | 33 | 70 (...
(81.58%) | 494 | [problem:471E] | 0 | 0 | 0 | 0 | 1 (100.00%) | 0 (0.00%)| 1 | , %) | 28 | 91 (18.42%) | 403 (81.58%) | 494 | [problem:471E] | 0 | 0 | 0 | 0 | 1 (100.00%) | 0 (0.00

Полный текст и комментарии »

  • Проголосовать: нравится
  • +16
  • Проголосовать: не нравится

9.
Автор kostka, 12 лет назад, По-английски
Hack me! — Year 2014 in review! (part 1.) Hey there! Since new year is coming, I want to start little summing-up of the ending one (of course we still talk about hacks :)). I wrote another short script, which purpose was to summarize all hacks in the 2014. I wanted to upload it after two last rounds, but mostly because of little differences (especially between first and second place), I did it before last rounds. Maybe the next rounds will be more exciting because of it. Below there is a list of 50 best hackers in this year <s>(so far)</s>, the full list can be found [here](http://test.weaselcrow.com/pro/cf/hack2014/). <strong>Update: </strong> After last round, the ranking was updated. The last round was decisive: [user:mosiomohsen,2014-12-31] made 5 successful hacks and 1 unsuccessful and with 450 points, he managed to surpass [user:anta,2014-12-31]. Congratulations! [cut] <div></div> rank | handle | points | best rounds | accuracy | :---:|:---:|:---:|:---:| 1 | [user:mosiomohsen,2014-12-31] | 8...
) | [contest:467] [+11-0] [contest:439] [+10-0] [contest:459] [+7-0] [contest:494] [+5, />[contest:494] [+5-0] [contest:500] [+5-0] | 80.0% | 10 | [user:VArtem,2014-12-31] | 5850

Полный текст и комментарии »

  • Проголосовать: нравится
  • +145
  • Проголосовать: не нравится

10.
Автор DmitriyH, 12 лет назад, По-английски
Codeforces Round #262 — #264 Statistics (Brief) Brief stats for rounds<br/> [contest:460]<br/> [contest:461]<br/> [contest:462]<br/> [contest:463] [cut] : ## Codeforces Round #262 (Div. 2) #### First accepted: **A** (00:01) [user:Birjik,2014-08-19] [user:E.K.Goharshady,2014-08-19] [user:Mihai22e,2014-08-19] [user:Slyusar,2014-08-19] [user:VladaMG98,2014-08-19] [user:add1ctus,2014-08-19] [user:dcms2,2014-08-19] [user:linjek,2014-08-19] <br/> **B** (00:07) [user:linjek,2014-08-19] [user:wao.uchiha,2014-08-19] <br/> **C** (00:11) [user:GFW_sb,2014-08-19] <br/> **D** (01:03) [user:quanbuwolaifuze,2014-08-19] <br/> **E** (01:34) [user:jellygendut,2014-08-19] <br/> #### Total hack attempts: +598:-274 #### Top-5 hackers: **1000** [user:Honour_00,2014-08-19] +10:-0 <br/> **1000** [user:VladaMG98,2014-08-19] +11:-2 <br/> **850** [user:linjek,2014-08-19] +10:-3 <br/> **800** [user:KingTon,2014-08-19] +8:-0 <br/> **800** [user:pk.,2014-08-19] +8:-0 <br/> ![ ](https://lh4.googleusercontent.com/-7WamkVz2llM/VAtzu1nF...
attempts: +494:-199 #### Top-5 hackers: **1050** [user:dwjdwjdwj,2014-08-30] +11:-1 **950, -30] #### Total hack attempts: +494:-199 #### Top-5 hackers: **1050** [user:dwjdwjdwj,2014-08

Полный текст и комментарии »

  • Проголосовать: нравится
  • +19
  • Проголосовать: не нравится

11.
Автор kostka, 12 лет назад, По-английски
Hack me! — Year 2014 in review! (part 2.) Merry Christmas everyone! One round behind us, one more to go in this year. It's time for the second part of my little summing-up (last post can be found [here](/blog/entry/15326)). Now we will show all most accurate hackers. We will count the accuracy as the: $$\frac{\#successfulhacks}{\#allhacks}$$ Because there were a lot of flawless hackers, below we show only hackers with at least 10 successful hacks &mdash; still there were 36 of them! The full list of hackers' accuracy can be found [here](http://test.weaselcrow.com/pro/cf/ahack2014/). Also, below this table there is updated list of best hackers by summarized points, also the full list was updated [here](http://test.weaselcrow.com/pro/cf/hack2014/). [cut] <div></div> ### Accuracy rank | handle | accuracy | best rounds | points | :---:|:---:|:---:|:---:| 1 | [user:hetanglianyi,2014-12-25] | 100.0% | <small>[contest:462] [+19-0]</small> | 1900 (+19-0) | 2 | [user:bmerry,2014-12-25] | 100.0% | <small>[c...
-25] | 100.0% | [contest:416] [+8-0] [contest:494] [+5-0] [contest:417] [+4-0], :494] [+5-0] [contest:460] [+4-2] | 78.75% | 9 | [user:VArtem,2014-12-25] | 5300 (+55-4, >[contest:416] [+8-0] [contest:494] [+5-0] [contest:417] [+4-0] | 1700 (+17-0) | 4

Полный текст и комментарии »

  • Проголосовать: нравится
  • +36
  • Проголосовать: не нравится

12.
Автор conqueror_of_marinush, история, 4 года назад, По-английски
Congratulations Timdee!!! Hello, users of Codeforces, today is a very special day. [user:TimDee,2022-04-16] has reached candidate master!!! It is very well deserved, you can even see from the pictures how much he has grinded <spoiler summary="Average TimDee Grinding Photos"> ![ ](https://cdn.discordapp.com/attachments/934481291993296966/997952718599630969/IMG_2253.png?width=418&height=625) ![ ](https://cdn.discordapp.com/attachments/934481291993296966/997952719014862868/IMG_2252.png?width=470&height=625) </spoiler> <spoiler summary="TimDee celebrating winning IOI2023 with his followers"> ![ ](https://media.discordapp.net/attachments/934481291993296966/997953416523423805/IMG_2255.png?width=896&height=494) </spoiler> <spoiler summary="TimDee Reaction to Candidate Master"> ![ ](https://media.discordapp.net/attachments/934481291993296966/997955221382774854/IMG_2256.png?width=326&height=625) </spoiler> So, big congratulations! I am a big fan and We wish you much health, love, esteem and respect f...
://media.discordapp.net/attachments/934481291993296966/997953416523423805/IMG_2255.png?width=896&height= 494

Полный текст и комментарии »

  • Проголосовать: нравится
  • +46
  • Проголосовать: не нравится

13.
Автор Harta, 17 лет назад, По-английски
Dynamic Programming Type <u>Dynamic Programming (DP) :</u><br><br><b>1. Classic Dynamic Programming</b><br>a. <a href="http://en.wikipedia.org/wiki/Longest_common_subsequence_problem">LCS</a><br>&nbsp;&nbsp; Problem: 1. <a href="https://www.spoj.pl/problems/SAMER08D/">SAMER08D<br></a><br>b. <a href="http://en.wikipedia.org/wiki/Longest_increasing_subsequence">LIS</a><br>&nbsp;&nbsp; Problem: 1. <a href="http://acm.sgu.ru/problem.php?contest=0&amp;problem=199">Beautiful People</a><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2. <a href="http://www.spoj.pl/problems/MDOLLS/">MDOLLS</a><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 3. <a href="http://www.spoj.pl/problems/MSTICK">MSTICK</a><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 4. <a href="http://www.spoj.pl/problems/MCARDS/">MCARDS</a><br><br>c. <a href="http://en.wikipedia.org/wiki/Edit_distance...
://acm.sgu.ru/problem.php?contest=0&problem=494">494 Thanks to , >, 494 <http://acm.sgu.ru/problem.php?contest=0&problem=<B>494</B>> Thanks to

Полный текст и комментарии »

  • Проголосовать: нравится
  • +4
  • Проголосовать: не нравится

14.
Автор fried-chicken, история, 5 лет назад, По-английски
Asking help for a short but funny problem from 2021 ICPC Shannxi invitational problem E This is a problem from 2021 ICPC Shannxi invitational and confuse me a lot. Since this contest have neither place to up-solving nor tutorial, I'm here to ask for idea and help. The problem is like: Given a number X, we call another number N is a lucky number to X if: 1. N is larger than 1e8; 2. N is smaller than 1e13; 3. (N!) begins with X. For example, if we ignore the first constraint, N=10 is a lucky number to X=3628 since (10!)=3628800. Now, given T testcases, each testcases gives you a X, output any N where N is a lucky number to X. T is smaller than 200 and X is smaller than 1e5. Sample input 2 494 997 Sample output 1000001586369 1000001980150 UPD: Thanks everybody for helping, I think using stirling's and brute force is the right one.
494

Полный текст и комментарии »

  • Проголосовать: нравится
  • +13
  • Проголосовать: не нравится

15.
Автор neo4104, 12 лет назад, По-английски
Dynamic Programming links This is from [user:Harta,2015-03-13]'s blog [here](http://codeforces.me/blog/entry/325) Some of the links were broken, so I wanted to update the ones which are still available. Dynamic Programming (DP) : -------------------------- ### Classic Dynamic Programming #### I. [Longest Common Subsequence (LCS)](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem) 1. [SAMER08D](http://www.spoj.com/problems/SAMER08D/) #### II. [Longest Increasing Subsequence (LIS)](http://en.wikipedia.org/wiki/Longest_increasing_subsequence) 1. [Beautiful People](http://acm.sgu.ru/problem.php?contest=0&problem=199) 1. [MDOLLS](http://www.spoj.com/problems/MDOLLS/) 1. [MSTICK](http://www.spoj.com/problems/MSTICK/) 1. [MCARDS](http://www.spoj.com/problems/MCARDS/) #### III. [Edit Distance](http://en.wikipedia.org/wiki/Edit_distance) #### IV. [Matrix Chain Multiplication](https://en.wikipedia.org/wiki/Matrix_chain_multiplication) 1. [Mixtures](http://www.spoj.com/problems/MIX...
) [489](http://acm.sgu.ru/problem.php?contest=0&problem=489) [494 ](http://acm.sgu.ru/problem.php, =489) [494](http://acm.sgu.ru/problem.php?contest=0&problem=494) Thanks to [user:natalia,2015-07

Полный текст и комментарии »

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

16.
Автор Z0RR0, история, 8 лет назад, По-английски
Codeforces Popularity Ranking Hello Codeforces! There has been several blogs similar to this. I know about [TOP 15 most popular users on codeforces](http://codeforces.me/blog/entry/49122) and [Who is the most popular?](http://codeforces.me/blog/entry/21041). But as none of these are updated, I thought this might be helpful. I have just calculated the most popular handles in Codeforces. I only considered those handles which have at least one rated contest. Begging my pardon to them who hasn't participated in any rated round. And here, the popularity depends simply on the number of people you are friend of. The complete standings can be found [here](https://docs.google.com/spreadsheets/d/1ADlF-bd6pBYCap75yzf-pUnVwI9f9YmPkiYNW3lD-xo/edit?usp=sharing)(This may took a while to load at the bottom). Anyway here is Top 200 handles. | Rank | Handle | Follower | |---|---|---| 1. | [user:tourist,2018-08-22] | 14082 | 2. | [user:Petr,2018-08-22] | 6430 | 3. | [user:OO0OOO00O0OOO0O00OOO0OO,2018-08-22] | 420...
-22] | 498 | 190. | [user:Nada,2018-08-22] | 494 | 190. | [user:flash_7,2018-08-22] |494 | 192, . | [user:Nada,2018-08-22] | 494 | 190. | [user:flash_7,2018-08-22] | 494 | 192. | [user:Hiasat,2018-08

Полный текст и комментарии »

  • Проголосовать: нравится
  • +169
  • Проголосовать: не нравится

17.
Автор WitchOfTruth, история, 6 лет назад, По-английски
Contests hack statistics (Number of hacks by round) Just felt like gathering some data about hacks. Parsed around ~400 last contests Probably it would be worth it to also include SFT, but whatever Educational 96 is not finished yet but also whatever Last 100 ------------------ **847** Educational Codeforces Round 96 (Rated for Div. 2) **30** Codeforces Global Round 11 **248** Codeforces Round #674 (Div. 3) **0** 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) **97** Bubble Cup 13 &mdash; Finals [Online Mirror, unrated, Div. 2] **86** Bubble Cup 13 &mdash; Finals [Online Mirror, unrated, Div. 1] **20** Codeforces Round #675 (Div. 2) **1** Codeforces Round #672 (Div. 2) **70** Codeforces Round #671 (Div. 2) **58** Educational Codeforces Round 95 (Rated for Div. 2) **3** Codeforces Round #673 (Div. 2) **11** Codeforces Round #673 (Div. 1) **73** Codeforces Round #667 (Div. 3) **121** Grakn Forces 2020 **4** Co...
(Div. 3)** 427 **Codeforces Round #494 (Div. 3)** 419 **Codeforces Round #653 (Div. 3)** 418, Round #661 (Div. 3)** 427 **Codeforces Round #494 (Div. 3)** 419 **Codeforces Round #653 (Div. 3

Полный текст и комментарии »

  • Проголосовать: нравится
  • +44
  • Проголосовать: не нравится

18.
Автор Temirulan, история, 2 года назад, По-английски
Who participated most? **UPD:** The calculation updated, for some reason I filtered only CF style competitions. Now it includes everything. Still [user:ruban,2024-08-07] best :) I revisited some data from Codeforces and, [after 5 years](https://codeforces.me/blog/entry/72410), decided to calculate again who has participated in the most contests. I took into account all official contest participations, including those where a user participated unofficially. However, I excluded Practice/Virtual contests. P.S: I think no one will beat [user:ruban,2024-08-07] ever :) |Rank|Handle|Total|Official|Unofficial| |---|---|---|---|---| | 1 | ![ ](https://codeforces.com/codeforces.org/s/97508/images/flags-16/ru.png) [user:ruban,2024-08-13] | 1164 | 1090 | 74 | | 2 | ![ ](https://codeforces.com/codeforces.org/s/97508/images/flags-16/jp.png) [user:kmjp,2024-08-13] | 972 | 547 | 425 | | 3 | ![ ](https://codeforces.com/codeforces.org/s/97508/images/flags-16/tw.png) [user:dreamoon_love_AA,2024-08-13] | 891 | 538 | 353 | | 4 | ![ ](https://codeforces.com/codeforces.org/s...
,2024-08-13] | 494 | 373 | 121 | | 37 | ![ ](https://codeforces.com/codeforces.org/s/97508/images/flags-16/bd.png, ://codeforces.com/codeforces.org/s/97508/images/flags-16/gb.png) [user:Um_nik,2024-08-13] | 494 | 373 | 121 | | 37

Полный текст и комментарии »

  • Проголосовать: нравится
  • +128
  • Проголосовать: не нравится

19.
Автор frunk, история, 5 месяцев назад, По-русски
How does 67 affect the post's rating? Let's look at the last post on the main page (at the moment it's about educational round 191). His rating is negative &mdash; -51. Let's look at the previous post about Codeforces Round 1102, which has a rating of +494. If we go further, we will find out that almost all posts on the main page collect a lot of positive reactions. And all because in the last post the author made a very funny joke about six seven. The community of smart people doesn't like this meme)
has a rating of +494. If we go further, we will find out that almost all posts on the main page

Полный текст и комментарии »

  • Проголосовать: нравится
  • +4
  • Проголосовать: не нравится

20.
Автор BanazadehAria, история, 7 лет назад, По-английски
494A Div 1 Treasure Problem I have written this code for problem 494A Div 1 Treasure Link==>https://codeforces.me/problemset/problem/494/A code==>[submission:55202990] My idea is that start from left and always have the differences between '(' and ')' (How many '(' with no ')' match we have ==> name this variable l) and then every time we get to an '#' we get the numbers of continuous ')' after that '#' until we face a '('. then the answer for that '#' is cnt(number of continuous ')' from '#') &mdash; l . But my code gets WA for test case 10 what is the problem with my observation?
/problem/494/A code==>[submission:55202990] My idea is that start from left and always have the

Полный текст и комментарии »

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

21.
Автор tinymon, 8 лет назад, По-английски
USACO - 2014 - doubt. Hi, I am new to codeforces :D I was trying [this](http://usaco.org/index.php?page=viewproblem2&cpid=494) problem, and I have a doubt in the editorial given [here](http://usaco.org/current/data/sol_guard_gold.html). How do we represent the function F without the parameter H? We cannot create a DP table if H was there as it would be too large. Also, H has to be a part of the function somehow. Can anyone explain how to maintain that constraint? Thanks for any help!
&cpid=494) problem, and I have a doubt in the editorial given [here](http://usaco.org/current/data, I was trying [this](http://usaco.org/index.php?page=viewproblem2&cpid=494) problem, and I have a

Полный текст и комментарии »

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

22.
Автор PavelKunyavskiy, 16 лет назад, По-русски
TopCoder Member SRM 494 <div>Если посмотреть Event Calendar на сайте TopCoder то там он 20 января. Если же нажать на информацию о раунде то там он 22 января, по информации на главной странице тоже 22-го.</div><div><br></div><div>На snarknews.info за последние несколько дней он сначала был 22 потом 20 теперь опять 22.&nbsp;</div><div><br></div><div>Когда же он все-таки будет?</div>
TopCoder Member SRM 494

Полный текст и комментарии »

  • Проголосовать: нравится
  • +8
  • Проголосовать: не нравится

23.
Автор da.2396, история, 10 лет назад, По-английски
Runtime Errors Recently I was working on Greedy problems and I encountered one of the very prominent problem of runtime error while submitting soln to ques . Problems are : http://codeforces.me/problemset/problem/494/A http://codeforces.me/problemset/problem/723/D Probable reason I could think of is corrupt memory access but Locally they are running well . My soln to the problem are: http://codeforces.me/contest/494/submission/21373511 http://codeforces.me/contest/723/submission/21299381 Any help is Appreciated .
/problemset/problem/494/A http://codeforces.me/problemset/problem/723/D Probable reason I could think, Problems are : http://codeforces.me/problemset/problem/494/A http://codeforces.com, http://codeforces.me/contest/494/submission/21373511 http://codeforces.me/contest/723

Полный текст и комментарии »

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

24.
Автор catlak_profesor_mfb, 12 лет назад, По-английски
Range Minimum Query(O(N),O(1)) Enjoy! http://paste.ubuntu.com/9507070/ Tested in: http://codeforces.me/contest/494/submission/9121141
Enjoy! http://paste.ubuntu.com/9507070/ Tested in: http://codeforces.me/contest/494/submission

Полный текст и комментарии »

  • Проголосовать: нравится
  • +38
  • Проголосовать: не нравится

25.
Автор Ac-93, 12 лет назад, По-русски
what was happened with dreamoon? Do you know causes of such strange [user:dreamoon,2014-12-15] and how to get place without any submissions http://codeforces.me/contest/494/standings/participant/3602199#p3602199 ? **Update:** Thank you very match, answer was gotten.
submissions http://codeforces.me/contest/494 /standings/participant/3602199#p3602199 ?

Полный текст и комментарии »

  • Проголосовать: нравится
  • +8
  • Проголосовать: не нравится

26.
Автор sdryapko, 16 лет назад, По-русски
SRM 494 Cегодня в 20:02 начался очередной SRM. <br>Предлагаю здесь после окончания СРМа вести его обсуждения
SRM 494

Полный текст и комментарии »

  • Проголосовать: нравится
  • +19
  • Проголосовать: не нравится

27.
Автор MikeMirzayanov, 6 лет назад, По-английски
Codeforces Global Rounds 2020: Final Results In 2020, with the support of XTX Markets, 6 rounds of the Codeforces Global Rounds were held. Each round was common for both divisions. All such rounds were rated for all participants. At each such round, 50 brand T-shirts were handed out, and we gave T-shirts to all problem writers! I say a big thank you to XTX Markets (and personally to Yuri Bedny and Alexander Gerko) for supporting Global Rounds. Without your help, we could not host them! I sincerely admire companies like these who come to support and develop the community that some of their employees come from. It will be great if other companies follow the example and also offer their help. We need it! The prizes for the 6-round series in 2020: - In each round, top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get...
| [user:conqueror_of_tourist,2020-12-08] | 494 | — | — | 244 | 226 | 24 | — | | 40

Полный текст и комментарии »

  • Проголосовать: нравится
  • +317
  • Проголосовать: не нравится

28.
Автор ankdroid, история, 10 лет назад, По-английски
Obsessive String (DIV 1 #282). Need help in understanding the DP state [Obsessive String](http://codeforces.me/contest/494/problem/B) The first part of substring search(using KMP ) is clear. I was going through the editorial but the DP state is unclear to me. Is it some standard counting technique. If yes could anyone provide similar problem links ?
[Obsessive String](http://codeforces.me/contest/494/problem/B) The first part of substring search

Полный текст и комментарии »

  • Проголосовать: нравится
  • +2
  • Проголосовать: не нравится

29.
Автор ashishranjan2828, история, 10 лет назад, По-английски
http://www.spoj.com/problems/HORRIBLE/ http://ideone.com/XwHMrW my solution is working fine for first test case and for second test answer should be 508 but it is giving 494... i have used lazy propagation concept... plz help
answer should be 508 but it is giving 494... i have used lazy propagation concept... plz help, giving 494... i have used lazy propagation concept...

Полный текст и комментарии »

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

30.
Автор R.A.X, 12 лет назад, По-английски
Code giving random answer on codeforces The below mentioned code is giving random answer on submission on codeforces, but on my local maschine it is giving correct answer. I am using the following g++ version gcc version 4.8.2 (Ubuntu 4.8.2-19ubuntu1) and compiling using the command g++ -g -std=c++0x d.cpp [code](http://codeforces.me/contest/494/submission/10573356)
/contest/494/submission/10573356)

Полный текст и комментарии »

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

31.
Автор orz, история, 4 года назад, По-русски
First Ever Users to Reach Some Rating Milestones Revised: ratings below 1500 and greatest rises Several days ago I published a [table](https://codeforces.me/blog/entry/104320) with first people to reach certain ratings. It featured only ratings above 1500, and [user:adamant,2022-07-09] advised to do the same, but on achieving ratings below 1500. I found it quite interesting, and, after several days of collecting data about participations of 447911 Codeforces users, I finally made this table. [cut] For several reasons I firstly put another table. This is the table of greatest rating rises in the history of Codeforces. The reasons are: 1. I have collected so much data from Codeforces that it would be blasphemy not to use it in as many ways as possible. 2. These tables might intersect a lot: it's easier to get a terrific rise in ratings if you are low-rated. (Many people abuse this and deliberately get very low-rated to make a great jump.) 3. Someone recently posted a table with greatest rating rises and falls. I wasn't able to find this table to check whether it was...
&hour=16&min=00&sec=00">2010-05-06 [contest:13] 494th, > [contest:13] 494th place

Полный текст и комментарии »

  • Проголосовать: нравится
  • +61
  • Проголосовать: не нравится

32.
Автор orz, история, 2 года назад, По-английски
Milestones: ratings below 1500 and greatest rises (2024 edition) <i>Note.</i> This is an updated version of [this post](https://codeforces.me/blog/entry/104683). If you like [this style](https://codeforces.me/blog/entry/104320) more, please tell me in the comments. Since [user:tourist,2024-09-05]'s [breakthrough](https://codeforces.me/blog/entry/133401), I've received a lot of requests to update my old posts with rating achievements. However, I wasn't able to do it immediately since my method of doing it requires to download the rating change history of every user, which, in turn, requires to perform several hundred thousand requests to Codeforces, about which the website (and Cloudflare) is not happy. It took more that three days, but finally the job is done! Below are two tables. The first one is the greatest positive rating changes. The second one is the first users ever to reach some rating value. [cut] <table> <tr> <th>Place</th> <th>&Delta;</th> <th>Person</th> </tr> <tr> <td>1<sup>st</sup></td> <td><b>1182<...
> [contest:13] 494th place

Полный текст и комментарии »

  • Проголосовать: нравится
  • +31
  • Проголосовать: не нравится