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

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

Результаты

1.
Автор Radewoosh, история, 8 лет назад, По-английски
Mindf**k of the day — rand() from c++ and Berlekamp–Massey algorithm Once, during one training, my team and I noticed something strange. I'll write a little bit later what it was exactly. The point is that after the contest we decided to investigate how c++ $rand()$ behaves on our machines (we use Linux). So, we used a Berlekamp–Massey algorithm on the results of $rand()$ taken modulo 2. The result is shocking — the length of the linear recurrence is only $527$! No, the results aren't cyclic, just the recurrence is short. "Cool, but who cares? Just some random fact which I wouldn't notice and it wouldn't have any impact on me." — wrong! We discovered it while solving a task which required calculating the rank of a binary matrix. We wanted to check something, so we just generated big matrix using $rand()$, which turned out to be a bad decision. As only the first $527$ columns were, let's say, independent, the rest were determined by first $527$ ones, so the rank didn't exceed $527$, and we lost much time just wondering what's happeni...
happening. Moreover, if the number of columns is even, the rank is only $496$ (for matrices big enough, Moreover, if the number of columns is even, the rank is only $496$ (for matrices big enough of, Yep, you're right — $496$. One can notice that $527-496=31$ and that $31$ divides $527

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

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

2.
Автор kostka, 12 лет назад, По-английски
Hack me! (Codeforces Round #283 (Div. 2)) Hey there! Here are the hacking statistics from [contest:496]. It wasn't very good round for hackers (especially because of strong pretests), but still &mdash; let's take a quick look. (Hacks description will be added later, sorry). Previous posts can be found [here](http://codeforces.me/search?query=hackme), including [div. 1](http://codeforces.me/blog/entry/15248). [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>Hackers efficiency**</small>| :---:|:---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:496A] </small> | 0 (0.00%) | 27 (55.10%)| 22 (44.90%) | 49 | 18 (0.81%) | 2193 (99.19%) | 2211 | 0.00% | <small> [problem:496B] </small> | 3 (8.57%) | 19 (54.29%)| 13 (37.14%) | 35 | 78 (6.67%) | 1091 (93.33%) | 1169 | 3.70% | <small> [problem:496C] </small> | 5 (11....
| :---:|:---:|:---:|:---:| [user:vishwacs111, 2014-12-17] | +2-1 (150) | C: 129848 <> , | [user:ChoeWonHyok, 2014-12-17] | +1-1 (50) | D: , /496/hacks), it appeared that many of them were simply Invalid Input. Happily for these people it, :28:16 | [user:Shahzodbek_Xusinov,2014-12-17] | [user:AdamantWharf,2014-12-17] |, Hey there! Here are the hacking statistics from [contest:496]., Room | #hacks | Hackers | :---:|:---:|:---:| 8 <>| 3 |

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

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

3.
Автор k790alex, история, 7 лет назад, По-английски
The 2019 ACM-ICPC Latin America Regional Contest Hi, [The 2019 ICPC Mexico Finals](https://icpc.baylor.edu/regionals/finder/mexico-2019) starts in 30 minutes. Let's discuss the problems after the contest. There are some mirror contests starting 1h after the real one: - https://www.juezguapa.com/concursos/icpc-latin-america-2019-final-official-mirror - https://matcomgrader.com/contest/overview/6254 - https://www.urionlinejudge.com.br/judge/en/contests/view/496 This facebook page is posting updates frequently: https://www.facebook.com/acmitesochapter Streaming: - From Universidad de Oriente de Santiago de Cuba (Spanish): https://www.facebook.com/icpc.caribbean.media/videos/433791383990095/ Good luck to all the teams. **UPDATE** The contest has started. **UPDATE** Live scoreboard: https://global.naquadah.com.br/boca/score/index.php (use this if the previous one doesn't work https://global.naquadah.com.br/boca/scoreglobal.php?h=AT2oE0HBeAg8eox30q5wZOdk8SY_bIZ-hGKuX9OTrY661HqiWgHRra4KBYyrxV6IDqZeTVr7y...
://matcomgrader.com/contest/overview/6254 - https://www.urionlinejudge.com.br/judge/en/contests/view/496, ://www.urionlinejudge.com.br/judge/en/contests/view/496 This facebook page is posting updates frequently: https

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

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

4.
Автор MikeMirzayanov, 8 лет назад, По-английски
Codeforces Round 496 (Div. 3) Hello! This time decided to fill myself in the shoes of the problem writers. It is very exciting! My challenge was to prepare a round in one day. It's really incredible pleasure to surrender to my passion and all day just work on problems! Despite the fact that in total I've wrote 8 problems, I made it in time. Initially, I prepared 7 problems, but two of them were found to be used before (thank you, [user:300iq,2018-07-09] and [user:_kun_,2018-07-09] for poining it) and I removed them and wrote a new problem. [contest:1005] will start on [contest_time:1005]. 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 Div. 1 not be at all interested by this problems. And for 1600-1899 the problems will be quite 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...
Codeforces Round 496 (Div. 3)

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

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

5.
Автор MikeMirzayanov, 8 лет назад, По-русски
Codeforces Round 496 (Div. 3): Problem Tutorials [tutorial:1005A] <spoiler summary="Code in C++ for details"> ~~~~~ int n; cin >> n; vector<int> a; int p = -1; forn(i, n) { int x; cin >> x; if (x == 1 && p != -1) a.push_back(p); p = x; } a.push_back(p); cout << a.size() << endl; for (int i: a) cout << i << " "; ~~~~~ </spoiler> [tutorial:1005B] <spoiler summary="Code in C++ for details"> ~~~~~ string s, t; cin >> s >> t; int w = 0; while (true) { int i = s.length() - w - 1; int j = t.length() - w - 1; if (i >= 0 && j >= 0 && s[i] == t[j]) w++; else break; } cout << s.length() + t.length() - 2 * w << endl; ~~~~~ </spoiler> [tutorial:1005C] <spoiler summary="Code in C++ for details"> ~~~~~ int n; cin >> n; vector<int> a(n); map<int,int> c; forn(i, n) { cin >> a[i]; c[a[i]]++; } int ans = 0; forn(i, n) { bool ok = false; forn(j, 31) { int x = (1 << j) - a[i]; if (c.count(x) && (c[...
Codeforces Round 496 (Div. 3): Problem Tutorials, Codeforces Round 496 (Div. 3): разбор задач

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

Разбор задач Codeforces Round 496 (Div. 3)
  • Проголосовать: нравится
  • +52
  • Проголосовать: не нравится

6.
Автор daftcoder, 16 лет назад, По-русски
TopCoder: Плагины для C++ и внешней среды разработки (MS Visual Studio) Доброго времени суток, дамы и господа!<br> <br> В преддверии приближающегося <a href="http://www.topcoder.com/tc?module=MatchDetails&amp;rd=14426">SRM 497</a> хочу продолжить рассказ о ТопКодере.<br> <br> Расскажу о установке некоторого набора плагинов TopCoder'а и MS Visual Studio. Язык программирования: C++.<br> [cut]<br> Эта статья является обещанным (но запоздалым :D) продолжением <a href="http://codeforces.me/blog/entry/371">первой</a> вводной статьи. Если вы ещё не участвовали в соревнованиях TopCoder::Algorithm раньше, но интересуетесь, то рекомендую сначала <a href="http://codeforces.me/blog/entry/371">прочитать её</a>.<br> <br> <u>Микроопыт и микрообзор плагинов.</u><br> Буквально вчера посмотрел предложения в первой теме от <a href="../../../profile/SkidanovAlex" title="Майор SkidanovAlex" class="rated-user user-yellow">SkidanovAlex</a> и <a href="../../../profile/KADR" title="Подполковник KADR" class="rated-user user-red">KADR</a>.<br> Сам раньше использовал предло...
фичам. Завтра, если проснусь к 5 утра, буду первый раз писать с moj, но заслать SRM- 496, Завтра, если проснусь к 5 утра, буду первый раз писать с moj, но заслать SRM-496 DIV-2 250 у меня

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

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

7.
Автор KEPuzOfficial, 7 месяцев назад, По-русски
KEP Contest #19 ![ ](/predownloaded/bf/71/bf710e988bfc8f255b882437a139833ebeef7507.jpg) I invite everyone to the [contest](https://kep.uz/contests/496), which will take place on **May, 3 2026 at 14:35UTC**. Interesting problems await you in the contest. **Contest info:** - Number of problems: **9-10** - Difficulty of problems: **<= 2400** - Duration: **2:30** - Contest type: **ACM10M** - Languages: **C++, Python, C, Kotlin, Haskell, R, Nodejs, PHP, C#, Java, Rust, Go** **Prizes:** - First place – **30$ (USDT)** - Second place – **20$** - Third place – **10$** Link to the platform: https://kep.uz P.S. Registration on the platform only via Gmail/Github. **UPD** Thank you for participating. I hope you enjoyed the contest. **Results** 1. [user:ywwuyi,2026-05-03] &mdash; **10** (424) 2. [user:JahonaliX,2026-05-03] &mdash; **9** (312) 3. [user:Timosh,2026-04-13] &mdash; **9** (389) 4. [user:DigitalVest,2026-05-03] &mdash; **9** (440) 5. [user:khba,202...
[contest](https://kep.uz/contests/496), which will take place on **May, 3 2026 at 14:35UTC, I invite everyone to the [contest](https://kep.uz/contests/496), which will take place on **May, 3

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

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

8.
Автор MikeMirzayanov, 16 лет назад, По-русски
Сазанка-2010, первые три дня - полет нормальный Прошли уже три дня сборов, проводимых Саратовским государственным университетом. В сборах участвует 18 команд и индивидуальных участников, всего 41 человек. Сборы проходят на замечательной базе отдыха «Домостроитель». Корпус, где живет большинство участников и проходят тренировки, находится на берегу Волги. Кроме таких традиционных развлечений как контесты, лекции и дорешивание на базе есть все условия для занятий волейболом, плаванием, поджариванием на солнышке. Кому не хватает солнечного тепла – добро пожаловать в сауну! <div style="width:500px;margin:1em auto;text-align:center;"> <img src="http://assets.codeforces.com/files/sazanka-2010/IMG_2384.1.JPG" style="width:400px"><br> Вид из окна </div> <div style="width:500px;margin:1em auto;text-align:center;"> <img src="http://assets.codeforces.com/files/sazanka-2010/IMG_2382.1.JPG" style="width:400px"><br> Участники сборов - <a href="http://codeforces.me/profile/homo_sapiens">homo_sapiens</a>, <a href="http://codeforces.me/p...
">496

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

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

9.
Автор pani.natalia, 5 лет назад, По-английски
Cities Of CodeForces — 2 Country and city in Codeforces user profiles are often not a the place of the residence but a state of mind. I am sure those 197 users who selected Antarctica as their country feel that their surrounding is cold. Or cool ) The map below shows data from user profiles which have both country and city. So only 16 of all antarctic profiles were taken into consideration, because other have empty city field. On 27 June 2021 there were 351898 users in the rating list. 88752 profiles contained both country and city. There were 4162 unique values of City field for 180 unique values for Country field. The size of circle is proportional to user number and different colors are used to divide cities on groups with the following numbers of users: <20, 20-99, 100 -249, 250-999, >1000. ![ ](/predownloaded/3a/d2/3ad21af4b9718a2284d9d0364e17111d4358ac0e.jpg) _._ [cut] _._ But let's look at some closeups. ![ ](/predownloaded/06/e0/06e0ee4cf770b772b540fce8bcfcba513a90c1e0.jpg) ...
, Vietnam 757; Seoul, South Korea 660; Almaty, Kazakhstan 634; Tokyo, Japan 496 ; Minsk, Belarus 472, ; Seoul, South Korea 660; Almaty, Kazakhstan 634; Tokyo, Japan 496; Minsk, Belarus 472; Damascus, Syria

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

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

10.
Автор FORHAD-SUST-BD, 16 лет назад, По-английски
Discussions Of CodeForces Round <h2 style="text-align: center;"><u>CodeForces Round</u></h2><div><u><br></u></div><div><a href="http://codeforces.me/blog/entry/84">CodeForces Beta Round 1</a><br></div><div><br></div><div><a href="http://codeforces.me/blog/entry/97">CodeForces Beta Round 2</a></div><div><br></div><div><a href="http://codeforces.me/blog/entry/141">CodeForces Beta Round 3</a></div><div><br></div><div><a href="http://codeforces.me/blog/entry/158">CodeForces Beta Round 4</a></div><div><br></div><div><a href="http://codeforces.me/blog/entry/196">CodeForces Beta Round 5</a></div><div><br></div><div><a href="http://codeforces.me/blog/entry/220">CodeForces Beta Round 6</a></div><div><br></div><div><a href="http://codeforces.me/blog/entry/239">CodeForces Beta Round 7</a></div><div><br></div><div><a href="http://codeforces.me/blog/entry/258">CodeForces Beta Round 8</a></div><div><br></div><div><a href="http://codeforces.me/blog/entry/276">CodeForces Beta Round 9</a></div><div><br></div><div><a href="ht...
CodeForces Beta Round 21 <http://codeforces.me/blog/entry/<B>496</B>>

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

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

11.
Автор xiaowuc1, 8 лет назад, По-английски
Mapping of SGU Problem IDs to Contests? A lot of, if not all, of the SGU problems come from old contests, though the SGU problem statements themselves often do not have the contest attribution associated with them. For example, problems 542 through 553 are the 2012 NEERC Southern Subregional, but that attribution is not present in the problem statements (as of the time of this post). Compare this with problems 201 through 208, which are stated as being part of a Petrozavodsk training contest (specifically ASC 2, though that is not explicitly mentioned in the statements). I'd like to assemble/crowdsource a comprehensive mapping of SGU problem IDs to the contests where the problems were originally hosted, and additionally links to them in the Codeforces gyms if they're hosted there. Does anyone have this mapping? I'm curious if the admins or anyone familiar with how the SGU problems were sourced to begin with can help out here, otherwise this can be easily crowdsourced. - 193-200: http://codeforces.me/gym/100199 (ASC 1...
only) - 485-496: http://codeforces.me/gym/101411 (NEERC Western Subregional 2009) - 497-507: http, /gym/100761 (Halloween Contest 2009, problems A-K only) - 485-496: http://codeforces.me/gym/101411

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

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

12.
Автор saketkumarsingh, 3 года назад, По-английски
USACO dp problem: I was trying to solve this question [Problem](http://www.usaco.org/index.php?page=viewproblem2&cpid=496) using the concept that answer would be the longest non increasing sequence but it fails on some test cases idk why? Please help me sort it out. Here is my Soln: ~~~~~ ~~~~~ #include <bits/stdc++.h> using namespace std; int find_lis(vector<int> a) { vector<int> dp; for (int i : a) { int pos = upper_bound(dp.begin(), dp.end(), i)- ``dp.begin(); if (pos == dp.size()) { // we can have a new, longer increasing subsequence! dp.push_back(i); } else { // oh ok, at least we can make the ending element smaller dp[pos] = i; } } return dp.size(); } int main(){ ifstream fin("cowjog.in"); ofstream fout("cowjog.out"); int n,t;fin>>n>>t; vector<vector<int>> v(n, vector<int>(2)); for(int i=0;i<n;i++) { int x,y;fin>>x>>y; v[i][0]=x, v[i][1]=y; } sor...
=496) using the concept that answer would be the longest non increasing sequence but it fails on

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

Теги dp, lis
  • Проголосовать: нравится
  • +9
  • Проголосовать: не нравится

13.
Автор devanshhhhhh, история, 7 месяцев назад, По-английски
Going Live - PCD Leetcode Weekly 496 Hello everyone, I will be going live on YouTube at 12:45 PM to discuss solutions for LeetCode Weekly Contest 496 on TLE Eliminators channel. Watch here: https://www.youtube.com/watch?v=D6kV_uJ3hLE In this session, we will: * Go through each problem step by step * Discuss optimal approaches and patterns * Write clean and efficient code * Share useful problem solving insights If you want to improve your data structures and algorithms skills, understand contest strategies, or code along, feel free to join. Bring your questions and approaches so we can make the session interactive and productive. See you there.
Going Live - PCD Leetcode Weekly 496, Weekly Contest 496 on TLE Eliminators channel. Watch here: https://www.youtube.com/watch?v, I will be going live on YouTube at 12:45 PM to discuss solutions for LeetCode Weekly Contest496 on

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

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

14.
Автор devanshhhhhh, история, 7 месяцев назад, По-английски
Going Live - PCD Leetcode Weekly 496 Hello everyone, I will be going live on YouTube at 12:45 PM to discuss solutions for LeetCode Weekly Contest 496 on TLE Eliminators channel. Watch here: https://www.youtube.com/watch?v=D6kV_uJ3hLE In this session, we will: * Go through each problem step by step * Discuss optimal approaches and patterns * Write clean and efficient code * Share useful problem solving insights If you want to improve your data structures and algorithms skills, understand contest strategies, or code along, feel free to join. Bring your questions and approaches so we can make the session interactive and productive. See you there.
Going Live - PCD Leetcode Weekly 496, Weekly Contest 496 on TLE Eliminators channel. Watch here: https://www.youtube.com/watch?v, I will be going live on YouTube at 12:45 PM to discuss solutions for LeetCode Weekly Contest496 on

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

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

15.
Автор LiebenDrittenReich, история, 8 лет назад, По-русски
случай на тренировки меня просто поразил Однажды во время одной тренировки мы с командой заметили что-то странное. Чуть позже напишу, что именно было. Дело в том, что после конкурса мы решили исследовать поведение c ++ rand () на наших машинах (мы используем Windows). Итак, мы использовали алгоритм Берлекампа – Масси по результатам rand (), взятым по модулю 2. Результат шокирует &mdash; длина линейного повторения составляет всего 527! Нет, результаты не являются циклическими, просто повторение является коротким. «Круто, но кого это волнует? Просто случайный факт, который я бы не заметил, и это не повлияло бы на меня». &mdash; неправильно! Мы обнаружили это при решении задачи, которая требовала вычисления ранга двоичной матрицы. Мы хотели что-то проверить, поэтому мы просто сгенерировали большую матрицу с помощью rand (), что оказалось плохим решением. Поскольку только первые 527 столбцов были, скажем, независимыми, остальные определялись первыми 527 столбцами, поэтому ранг не превышал 527, и мы потеряли много времени...
составляет всего 496 (конечно, для матриц достаточно больших размеров). Угадайте, какова длина повторения, Более того, если число столбцов четное, ранг составляет всего 496 (конечно, для матриц достаточно, Да, вы правы — 496. Можно заметить, что 527 — 496 = 31, а 31 делит 527! Иллюминаты!

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

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

16.
Автор checkMate09, история, 10 лет назад, По-английски
Interesting mathematical facts, numbers :) _**Hello Codeforces.**_ Recently I was solving (UVA-10490) [perfect numbers] that I found tackling the problem knowing an interesting mathematical fact would make it very very simple unlike if you don't know this fact. so I thought it would be useful to gather some interesting mathematical numbers and it would be very kind of anyone to share an mathematical formula, facts, numbers that can help in tackling such problems. **1) Narcissistic Numbers** --------------------------- Narcissistic numbers, also known as Armstrong numbers or “pluperfect digital invariants,” are numbers that—listen closely—are equal to the sum of each of its digits when those digits are raised to the power of the AMOUNT of digits in the number.Ok. What? Let’s take an example of the four existing narcissistic cubes:153 = 1^3 + 5^3 + 3^3 370 = 3^3 + 7^3 + 0^3 371 = 3^3 + 7^3 + 1^3 407 = 4^3 + 0^3 + 7^3In these cases, each digit is cubed because there are three digits in the number. Then, those cubed...
divisors (1, 2, 3) all up to 6. Six is followed by 28, 496, and 8,128. Early Greek mathematicians knew, is followed by 28, 496, and 8,128. Early Greek mathematicians knew only of these first 4 perfect

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

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

17.
Автор Scofield11, история, 8 лет назад, По-английски
How to solve this problem ? There is a square 3x3 consisting of 9 natural numbers. The sum of every row, every column and both diagonals are mutually the same (row 1 has the same sum as row2, row3, column1, column2 etc.). Some numbers were deleted from the square (deleted numbers are numbered as 0) and the task is to restore those numbers. It is guaranteed that the task is solvable and that there will never be more than 3 deleted numbers. All numbers are less than 20000. Input: ~~~~~ 5 10 3 4 0 8 9 2 7 ~~~~~ Output: ~~~~~ 5 10 3 4 6 8 9 2 7 ~~~~~ Input: ~~~~~ 0 11 11 15 9 0 7 7 13 ~~~~~ Output: ~~~~~ 5 11 11 15 9 3 7 7 13 ~~~~~ Input: ~~~~~ 496 469 0 0 523 415 442 0 550 ~~~~~ Output: ~~~~~ 496 469 604 631 523 415 442 577 550 ~~~~~ I have some ideas, and I've tried to do the task, but my way wouldn't work on all test cases.
15 9 0 7 7 13 ~~~~~ Output: ~~~~~ 5 11 11 15 9 3 7 7 13 ~~~~~ Input: ~~~~~ 496, ~~~~~ 496 469 0 0 523 415 442 0 550 ~~~~~, ~~~~~ 496 469 604 631 523 415 442 577 550 ~~~~~

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

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

18.
Автор 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. 2)** 184 **Codeforces Round #511 (Div. 1)** 181 **Codeforces Round #496 (Div. 3)** 179, Round #556 (Div. 2)** 184 **Codeforces Round #511 (Div. 1)** 181 **Codeforces Round #496 (Div. 3

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

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

19.
Автор gelastropod, история, 6 месяцев назад, По-английски
Counterexample to IOI Sphinx model code So I was trying to upsolve IOI 2024 Q6 Sphinx. In the editorial phase 2 states to split the condensed graph into two sets, and perform binary search on these sets for every colour, to determine which components have what colour. However, each binary search needs $\log N\approx8$ queries to perform the actual binary search, along with an additional query to "confirm" that no other component in the set has that colour. Along with the rest of the solution, this gives a query count of $3N+a+N\log N$, where $a$ is the number of monochromatic components. This means that, in the worst case, the solution would take $4N+N\log N$, which is up to $3000$ queries, more than is allowed in the problem. At first, I thought that there would be some amortisation which keeps the query count under the limit of $2750$ queries, but then I made the following construction: Consider the test case with $N=250$ vertices, all with different colours. Then, the graph is constructed by taking the first 248 vertic...
out yourself. ~~~~~ 250 496 0 1 2 3 4 5 6 7 8 9 10 11 12, ~~~~~ 250 496 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

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

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

20.
Автор notreal_fake, история, 3 года назад, По-английски
happy new year ![ ](https://media.discordapp.net/attachments/1000895573991362623/1191441778264510504/image.png?ex=65a5739f&is=6592fe9f&hm=1d2821988cfece7340703d5733872aab8fbf81af1502a4e7cf1ade1862cb8cde&=&format=webp&quality=lossless&width=496&height=663)
=webp&quality=lossless&width=496&height=663)

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

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

21.
Автор 300pound, 12 лет назад, По-английски
Problem with 496C test case 20! Hi. I'm trying to solve 496C here but I ran into a problem with test case 20. Any help would be greatly appreciated. [http://codeforces.me/contest/496/submission/9372508]( http://codeforces.me/contest/496/submission/9372508)
greatly appreciated. [http://codeforces.me/contest/496/submission/9372508]( http://codeforces.com, Any help would be greatly appreciated. [http://codeforces.me/contest/496 /submission/9372508

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

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

22.
Автор Egor, 16 лет назад, По-русски
TopCoder SRM 496 Будет через пол часа<div>Одному мне письмо с напоминалкой не пришло?</div>
TopCoder SRM 496

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

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

23.
Автор pranshul, 12 лет назад, По-английски
Help with Round #283(Div. 1 C) I have tried to implement the solution for http://codeforces.me/problemset/problem/496/E based on what I could understand by translating the editorial to english. My code is failing on 10th test case. Please help me find a bug in my code. Thanks in advance. :) http://codeforces.me/contest/496/submission/9187611 EDIT: Accepted!!
I have tried to implement the solution for http://codeforces.me/problemset/problem/496/E based on, http://codeforces.me/contest/496/submission/9187611

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

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

24.
Автор arsijo, 7 лет назад, По-английски
Codeforces Global Rounds 2019: Final Results In 2019, with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds were held. Each round was common for both divisions and had 7–9 problems. The duration of the rounds was 2-3 hours, depending on the number and complexity of the problems. 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 authors and problem testers as well. The prizes for the 6-round series in 2019: - 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 sweatshirts and place certificates. Final results: [cut]<br/> | Place | Contestant | = | Round 1 | Round 2| Round 3 | Round 4 | Round 5 | Round 6 | | - | - | - | - | - | - | - | - | - | | 1 | [user:tourist,2019-12-17] | <b> 2987 </b> | ...
| 97 | | 36 | [user:betrue12,2019-12-17] | 496 | 0 | 0 | 0 | 80 | , | [user:betrue12,2019-12-17] | 496 | 0 | 0 | 0 | 80 | 181 | 235

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

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

25.
Автор CtrlAlt, 15 лет назад, По-русски
Поправочные коэффициенты и инфляция рейтинга <P>Результат последнего контеста оказался для меня довольно неожиданным, поэтому я решил собрать немного больше информации о возможностях изменения рейтинга CF. Если профиль участника позволяет наблюдать историю изменения&nbsp;его рейтинга, то у меня получились "профили контестов", в которых отражены рост или падение каждого участника конкретного соревнования.<BR>[cut]<BR><A href="http://codeforces.me/blog/entry/102">Формула расчёта&nbsp;рейтинга Codeforces</A> подразумевает сохранение суммы очков всех участников до и после раунда за счёт поправочных коэффициентов. На основании же обработанной мной информации получилась такая табличка:</P> <TABLE style="WIDTH: 100%" border=1> <TBODY> <COLGROUP> <COL width="20%"> <COL width="20%"> <COL width="20%"> <COL width="20%"> <COL width="20%"> <TBODY> <TR> <TD>ID контеста</TD> <TD>Суммарный рейтинг до соревнования</TD> <TD>Суммарный рейтинг после соревнования</TD> <TD>Разность конечного и исходного суммарных рейтингов</TD> <TD>Коли...
/standings">496 49 <http://codeforces.me/contest/49> 491745, > 496 <http://codeforces.me/contest/48/standings>

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

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

26.
Автор 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...
&sec=00">2011-12-16 [contest:137] 496th place, ] 496th place 773 <>

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

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

27.
Автор 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<...
">2011-12-16 [contest:137] 496th place , &sec=00">2011-12-16 [contest:137] 496th place

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

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