You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

1.
By Agnimandur, history, 5 years ago, In English
April Fools Day Contest 2022 With [user:Nickolas,2022-03-29] not writing a contest this year, [user:magnus.hegdahl,2022-03-29] and I have decided to take up this sacred duty :). We would like to invite everyone on Codeforces to the [contest: 1663]. Special thanks to [user:BucketPotato,2022-03-29] for volunteering to test this contest! The 10th April Fools Day Contest will take place on [contest_time:1663]. This is a joke competition in which solving the problem is often easier than figuring out what the actual task is. In this round you'll be given several weird problems and 2 hours to solve them. The contest will use ACM ICPC rules (no hacks, the standings are decided by the number of solved problems and penalty time earned on them), and it will be unrated. You can submit solutions in any language allowed by Codeforces, unless the problem says otherwise. To get an idea of what the contest will look like, you can check out the contests of the past years: [2012](https://codeforces.me/contest/171), [2013](htt...
| [user:MatrixCascade_qwq,2022-04-01] | 7 (330) | 2 | [user:kk19212,2022-04-01] | 7 (339

Full text and comments »

  • Vote: I like it
  • +538
  • Vote: I do not like it

2.
By Shayan, 2 years ago, In English
Graph Algorithms Problem Solving — from Easy to Expert Hi, We had a problem-solving session on graph algorithms today. I selected problems that don’t require many prerequisites and are focused on generating ideas. I hope you find it enjoyable and educational. This video is for people from starter to expert level. ### 330B &mdash; Road Construction In this problem, we use a constraint on m that helps us solve it easily. The link to the problem: https://codeforces.me/problemset/problem/330/B <spoiler summary="Video"> <iframe width="800" height="450" src="https://www.youtube.com/embed/mDCbr8moyWc?si=oFiHqQ2Ej6bwbG1B&amp;start=183" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" referrerpolicy="strict-origin-when-cross-origin" allowfullscreen></iframe> </spoiler> ### 687A &mdash; NP-Hard Problem In this problem, you’ll get familiar with the concept of a vertex cover, and we’ll apply what we’ve learned about bipart...
problem: https://codeforces.me/problemset/problem/330/B , The link to the problem: https://codeforces.me/problemset/problem/330/B

Full text and comments »

  • Vote: I like it
  • +27
  • Vote: I do not like it

3.
By NercNews, 6 years ago, translation, In English
Northern Eurasia Finals 2020: Offline <img src="/predownloaded/c0/fe/c0fe3f2c5397274930f617ee822bdaecd5966927.jpg" align="right" style="height: 255px; margin: 10px;" alt="text"/> Hello everyone! After all online qualifiers, we are pleased to announce that the **Northern Eurasia Finals** and ICPC 2021 semi-final offline stage will take place this weekend on **April 3-4**! <a href="https://youtu.be/65oO4Zauvgc" style="font-size: 15.0px;padding: 8.0px 14.0px;background-color: rgb(240, 170, 10);color: white;">ICPCLive broadcast</a> <a href="http://nerc.itmo.ru/archive/2020/standings.html" style="font-size: 15.0px;padding: 8.0px 14.0px;background-color: rgb(76, 131, 195);color: white;">Standings</a> <a href="https://codeforces.me/contests/1510" style="font-size: 15.0px;padding: 8.0px 14.0px;background-color: rgb(76, 131, 195);color: white;">Mirror</a> <a href="http://nerc.itmo.ru/archive/2020/problems.pdf" style="font-size: 15.0px;padding: 8.0px 14.0px;background-color: rgb(76, 131, 195);color: white;">Problems</...
out of 330** were selected for the **Northern Eurasia Finals**. Most of the teams will compete in, : white;">Разбор задач В декабре 2020 по результатам онлайн-тура чемпионата из почти330, В декабре 2020 по результатам онлайн-тура чемпионата из почти 330 студенческих команд были отобраны

Full text and comments »

  • Vote: I like it
  • +363
  • Vote: I do not like it

4.
By Shayan, 2 years ago, In English
Codeforces Round 963 (Div. 2) — Video Tutorial ### [1993A &mdash; Question Marks](https://codeforces.me/contest/1993/problem/A) <spoiler summary="Video"> <iframe width="850" height="475" src="https://www.youtube.com/embed/Qmyvy8-4SH4?si=GsNg4eyMjS5Sl1Uc&amp;start=118" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" referrerpolicy="strict-origin-when-cross-origin" allowfullscreen></iframe> </spoiler> ### [1993B &mdash; Parity and Sum](https://codeforces.me/contest/1993/problem/B) <spoiler summary="Video"> <iframe width="850" height="475" src="https://www.youtube.com/embed/Qmyvy8-4SH4?si=GsNg4eyMjS5Sl1Uc&amp;start=330" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" referrerpolicy="strict-origin-when-cross-origin" allowfullscreen></iframe> </spoiler> ### [1993C &mdash; Light Switches](https://codeforces.me/co...
/Qmyvy8-4SH4?si=GsNg4eyMjS5Sl1Uc&start=330" title="YouTube video player" frameborder="0" allow, ="850" height="475" src="https://www.youtube.com/embed/Qmyvy8-4SH4?si=GsNg4eyMjS5Sl1Uc&start=330

Full text and comments »

  • Vote: I like it
  • +7
  • Vote: I do not like it

5.
By niyaznigmatul, 10 years ago, In Russian
ACM ICPC 2016-2017, NEERC, Northern Subregional Contest Всем привет. Завтра, 22 октября 2016 года, в Санкт-Петербурге состоится Северный четвертьфинал Северо-восточного Европейского региона ACM ICPC. Прошлый сезон [закончился](http://zibada.ru/finals/2016/) тем, что команда, занявшая второе место в [прошлогоднем четвертьфинале](http://neerc.ifmo.ru/past/2015/northern/standings.html), стала чемпионом мира. Наши поздравления Алексею Гордееву, Игорю Пышкину, Станиславу Ершову и их бессменному тренеру Андрею Лопатину. Для Алексея это был второй финал ACM ICPC, а за Игорем и Станиславом мы еще последим. <img src="http://codeforces.me/predownloaded/82/f1/82f16c2ccb7676fcaed20b90a210c36c15ab8329.jpg" align="right" style="height: 300px; margin: 4px;" alt="text"/> На данный момент в системе регистрации icpc.baylor.edu зарегистрировано [107 команд](http://neerc.snarknews.info/index.cgi?data=macros/regstat&head=index&menu=index&year=2016&qf=northern&class=northern2016&text=Northern%20QF). Завтра утром будет открытие, пробный тур и в [12 часов...
/qual/standings.html)), в котором в этом году поучаствовало более 330 команд. Более подробно об этом, /standings.html)), в котором в этом году поучаствовало более 330 команд. Более подробно об этом можно

Full text and comments »

  • Vote: I like it
  • +125
  • Vote: I do not like it

6.
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 55 [Rated for Div. 2] On [contest_time:1082] [contest:1082] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Mike [user:MikeMirzayanov,2018-11-27] Mirzayanov, Roman [user:Ajosteen,2018-11-27] Glazov, Adilbek [user:adedalic,2018-11-27] Dalabaev, Vladimir [user:V...
-29] 7 330 3 [user:halyavin, > 2 [user:theodor.moroianu, 2018-11-29] 7 330, >[user:theodor.moroianu, 2018-11-29] 7 330 3

Full text and comments »

  • Vote: I like it
  • +117
  • Vote: I do not like it

7.
By danilka.pro, history, 11 years ago, translation, In English
Codeforces Round #330 Добрый день, Codeforces! Рад сообщить, что в это воскресенье, [8го ноября в 19:30 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23330&iso=20151108T1930&p1=166&ah=2) состоится Codeforces Round #330 для участников обоих дивизионов. Задачи для вас уже не в первый раз с удовольствием придумывали и готовили Александр [user:fcspartakm,2015-11-07] Фролов и я, Данил Сагунов. Мы говорим спасибо координатору Codeforces Глебу [user:GlebsHP,2015-11-07] Евстропову за существенную помощь в подготовке задач, Михаилу [user:MikeMirzayanov,2015-11-07] Мирзаянову за системы Codeforces и Polygon, Марии [user:Delinur,2015-11-07] Беловой за перевод условий на английский язык, а также Владиславу [user:winger,2015-11-07] Исенбаеву и Александру [user:AlexFetisov,2015-11-07] Фетисову за тестирование и прорешивание задач раунда. Каждому из участников раунда будет предоставлено два часа на решение пяти задач. Мы постарались сделать задачи разнообразными и интересными, и ...
Codeforces Round #330, #330 for both divisions will take place., Round #330 для участников обоих дивизионов.

Full text and comments »

  • Vote: I like it
  • +99
  • Vote: I do not like it

8.
By fcspartakm, history, 11 years ago, translation, In English
Codeforces Round #330 (Div.1 + Div.2) Editorial [595A &mdash; Vitaly and Night](http://codeforces.me/problemset/problem/595/A) It was easy realization problem. Let's increase the variable $i$ from 1 to n, and inside let's increase the variable $j$ from 1 to $2 \cdot m$. On every iteration we will increase the variable $j$ on 2. If on current iteration $a[i][j] = '1'$ or $a[i][j + 1] = '1'$ let's increase the answer on one. Asymptotic behavior of this solution &mdash; $O(n m)$. [595B &mdash; Pasha and Phone](http://codeforces.me/problemset/problem/595/B) Let's calculate the answer to every block separately from each other and multiply the answer to the previous blocks to the answer for current block. For the block with length equals to $k$ we can calculate the answer in the following way. Let for this block the number must be divided on $x$ and must not starts with digit $y$. Then the answer for this block &mdash; the number of numbers containing exactly $k$ digits and which divisible by $x$, subtract the n...
Codeforces Round #330 (Div.1 + Div.2) Editorial, Разбор Codeforces Round #330 (Div.1 + Div. 2)

Full text and comments »

  • Vote: I like it
  • +53
  • Vote: I do not like it

9.
By NercNews, 6 years ago, In Russian
Northern Eurasia Finals 2020: Online <img src="/predownloaded/2d/86/2d86ae88df64b8aa1e15ece530a4f334bbc325bd.jpg" align="right" style="height: 255px; margin: 10px;" alt="text"/> Всем привет! В воскресенье 13 декабря состоится дистанционный этап **Финальных Соревнований Северной Евразии** &mdash; полуфинала ICPC. <a href="https://youtu.be/pvzNyAhwWFw" style="font-size: 15.0px;padding: 8.0px 14.0px;background-color: rgb(240, 170, 10);color: white;">Трансляция от ICPCLive</a> <a href="https://nerc.itmo.ru/archive/2020/standings.html" style="font-size: 15.0px;padding: 8.0px 14.0px;background-color: rgb(76, 131, 195);color: white;">Таблица результатов</a> <a href="https://codeforces.me/gym/102896" style="font-size: 15.0px;padding: 8.0px 14.0px;background-color: rgb(76, 131, 195);color: white;">Тренировка</a> <a href="https://nerc.itmo.ru/archive/2020/nerc-2020-online-statement.pdf" style="font-size: 15.0px;padding: 8.0px 14.0px;background-color: rgb(76, 131, 195);color: white;">Условия задач</a> <a href="ht...
К участию в Northern Eurasia Finals Online было приглашено почти 330 команд. Основной тур

Full text and comments »

  • Vote: I like it
  • +99
  • Vote: I do not like it

10.
By vovuh, history, 8 years ago, translation, In English
Codeforces Round #515 (Div. 3) After the long delay (disease, conference and many other things) the new Div.3 round is coming! &lt;copy-pasted-part&gt; Hello! [contest:1066] will start at [contest_time:1066]. You will be offered 6 or 7 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. [cut] You will be given 6 or 7 problems and 2 hours to solve them. Note th...
-13] 6 330 Поздравляем лучших, > 5 [user:wythend, 2018-10-13] 6 330, >330 Congratulations to the best hackers:

Full text and comments »

  • Vote: I like it
  • +98
  • Vote: I do not like it

11.
By erikr, 13 years ago, In English
Haskell solutions For those who are interested, here is a list of all problems for which Haskell solutions have been submitted. (Use the 'Status filter' to show only the Haskell submissions.) [1A](http://codeforces.me/problemset/status/1/problem/A) [1B](http://codeforces.me/problemset/status/1/problem/B) [1C](http://codeforces.me/problemset/status/1/problem/C) [2A](http://codeforces.me/problemset/status/2/problem/A) [2B](http://codeforces.me/problemset/status/2/problem/B) [2C](http://codeforces.me/problemset/status/2/problem/C) [3A](http://codeforces.me/problemset/status/3/problem/A) [3B](http://codeforces.me/problemset/status/3/problem/B) [3C](http://codeforces.me/problemset/status/3/problem/C) [3D](http://codeforces.me/problemset/status/3/problem/D) [4A](http://codeforces.me/problemset/status/4/problem/A) [4B](http://codeforces.me/problemset/status/4/problem/B) [4C](http://codeforces.me/problemset/status/4/problem/C) [4D](http://codeforces.me/problemset/status/4/problem/D)...
://codeforces.com/problemset/status/330/problem/A) [330B](http://codeforces.me/problemset/status/330/problem/B, [330A](http://codeforces.me/problemset/status/330/problem/A) [330B](http://codeforces.com

Full text and comments »

  • Vote: I like it
  • +19
  • Vote: I do not like it

12.
By pani.natalia, 5 years ago, In English
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) ...
467; Kiev, Ukraine 409; Tbilisi, Georgia 330; Amman, Jordan 305; Bucharest, Romania 305. And, ; Damascus, Syria 467; Kiev, Ukraine 409; Tbilisi, Georgia 330; Amman, Jordan 305; Bucharest, Romania 305.

Full text and comments »

  • Vote: I like it
  • +154
  • Vote: I do not like it

13.
By rng_58, history, 8 years ago, In English
ExaWizards 2019 [ExaWizards 2019](https://atcoder.jp/contests/exawizards2019) will be held on Saturday [(time)](http://www.timeanddate.com/worldclock/fixedtime.html?iso=20190330T2100&p1=248). The writers are [user:semiexp,2019-03-29] and [user:camypaper,2019-03-29]. [Contest Announcement](https://atcoder.jp/posts/330) Contest duration: 120 minutes Rated range: <2800 The point values will be 100 &mdash; 200 &mdash; 500 &mdash; 600 &mdash; 700 &mdash; 1200. Let's discuss problems after the contest. (Note: we noticed that it overlaps with SRM, but this is a sponsored contest and at this moment it's difficult to move it. Sorry about that.)
/posts/330) Contest duration: 120 minutes Rated range: <2800 The point values will be 100, [Contest Announcement](https://atcoder.jp/posts/330)

Full text and comments »

  • Vote: I like it
  • +57
  • Vote: I do not like it

14.
By emorgan, history, 6 years ago, In English
Why does this solution work? This concerns the following problem: [problem:680D]. Here's a rough outline of my thoughts while solving this problem. Let $f(m, x)$ be the optimal number of boxes (we can ignore the part about maximizing $X$, it's trivial to extend the solution to also accomplish this) for input $m$, where we are only allowed to use boxes of length at most $x$. The answer to the original problem is $f(m, 10^5)$, we have the base case $f(m, 0)=0$, and $f$ satisfies the recurrence $$ f(m, x) = \max\begin{cases} f(m-x^3, x)+1 & \text{if we take a cube of length $x$} \\ f(\min(m, x^3-1), x-1) & \text{if we don't} \\ \end{cases} $$ Evaluating $f(m, x)$ with DP is too slow for large $m$, but we can make the observation that for each pair $(m, x)$, it is either optimal to take a cube or not to take a cube, and that if it is optimal to take for $(m, x)$, then it must also be optimal to take for $(m+1, x)$. I don't have a rigorous proof for this, but it is intuitively true and AC submi...
, 15, 23, 50, 50, 114, 114, 114, 114, 330, ..., 1330, ..., 10591, ..., 215970, ..., 19464802, , 330, ..., 1330, ..., 10591, ..., 215970, ..., 19464802, ..., 16542386125 $$ Where the later values

Full text and comments »

  • Vote: I like it
  • +18
  • Vote: I do not like it

15.
By atcoder_official, history, 3 years ago, In English
TOYOTA SYSTEMS Programming Contest 2023(AtCoder Beginner Contest 330) Announcement We will hold TOYOTA SYSTEMS Programming Contest 2023(AtCoder Beginner Contest 330). - Contest URL: https://atcoder.jp/contests/abc330 - Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20231125T2100&p1=248 - Duration: 100 minutes - Writer: [user:nok0,2023-11-24], [user:physics0523,2023-11-24], [user:evima,2023-11-24], [user:ynymxiaolongbao,2023-11-24] - Tester: MMNMM, [user:leaf1415,2023-11-24] - Rated range: ~ 1999 - The point values: 100-200-300-400-475-525-625 We are looking forward to your participation!
TOYOTA SYSTEMS Programming Contest 2023(AtCoder Beginner Contest 330) Announcement, We will hold TOYOTA SYSTEMS Programming Contest 2023(AtCoder Beginner Contest 330).

Full text and comments »

  • Vote: I like it
  • +59
  • Vote: I do not like it

16.
By MiptLited, 7 years ago, translation, In English
Russian school students took 4 gold medals at the International Olympiad in Informatics (IOI-2019) ![ ](/predownloaded/10/eb/10eb8b043e11d8460cc8c02e5cb7ae4e93edab4b.jpg) It is a very rare situation at IOI. It happened at IOI-2012 in Montichiari in Italy for the last time. - Ildar Gainullin (11th grade of the Lyceum named after N. And. Lobachevsky, Kazan Federal University) - Alexander Morozov (graduate of the Presidential physics and mathematics Lyceum № 239, St. Petersburg) - Vladimir Romanov (graduate of Moscow state University Specialized educational and scientific center) - Egor Lifar (10th grade Intellectual school, Moscow) Russian team took the first place in the medal standings and second &mdash; in points am ong 88 countries (more than 330 students participated in the Olympiad). The selection and training of the national team was held at the Moscow Institute of Physics and Technology second year in a row. Trainers from MIPT, University ITMO, National Research Lobachevsky State University, Moscow State University, Higher School of Economics and Moscow Work...
countries (more than 330 students participated in the Olympiad)., medal standings and second — in points am ong 88 countries (more than 330 students participated

Full text and comments »

  • Vote: I like it
  • +48
  • Vote: I do not like it

17.
By MarioYC, 15 years ago, In English
SGU 330 — Numbers [Link](http://acm.sgu.ru/problem.php?contest=0&problem=330) I'm trying to understand when there is a solution (even though it may have more than 500 moves). It can't always be done with one divisor, for example A = 4, B = 9 (4->6->9), but I think it can always be done with two divisors, a proof of this would be related somehow to [Bezout's identity](http://www.cut-the-knot.org/blue/Euclid.shtml). Say we pick d1 divisor of A, and d2 divisor of B then we can find integers x,y such that $d1*x+d2*y = B - A$ since the gcd of d1 and d2 divides B --- A, the thing is that one of x and y could be negative. Is there a way to make both positive?
SGU 330 — Numbers, [Link](http://acm.sgu.ru/problem.php?contest=0&problem=330)

Full text and comments »

  • Vote: I like it
  • +13
  • Vote: I do not like it

18.
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 127 Editorial [problem:1671A] Idea: [user:BledDest,2022-04-23] <spoiler summary="Tutorial"> [tutorial:1671A] </spoiler> <spoiler summary="Solution (BledDest)"> ~~~~~ t = int(input()) for i in range(t): s = input() ans = True n = len(s) for j in range(n): if (j == 0 or s[j] != s[j - 1]) and (j == n - 1 or s[j] != s[j + 1]): ans = False print('YES' if ans else 'NO') ~~~~~ </spoiler> [problem:1671B] Idea: [user:vovuh,2022-04-23] <spoiler summary="Tutorial"> [tutorial:1671B] </spoiler> <spoiler summary="Solution (vovuh)"> ~~~~~ for i in range(int(input())): n = int(input()) x = list(map(int, input().split())) print('YES' if x[-1] - x[0] - n + 1 <= 2 else 'NO') ~~~~~ </spoiler> [problem:1671C] Idea: [user:vovuh,2022-04-23] and [user:BledDest,2022-04-23] <spoiler summary="Tutorial"> [tutorial:1671C] </spoiler> <spoiler summary="Solution (adedalic)"> ~~~~~ fun main() { repeat(rea...
; cnt[12][1][11] = 11; cnt[12][2][11] = 165; cnt[12][3][11] = 462; cnt[12][4][11] =330, ; cnt[12][2][11] = 165; cnt[12][3][11] = 462; cnt[12][4][11] = 330; cnt[12][5][11, ] = 330; cnt[12][5][11] = 55; cnt[12][6][11] = 1; }

Full text and comments »

  • Vote: I like it
  • +70
  • Vote: I do not like it

19.
By 7oSkaaa, history, 5 years ago, In English
Topics Problems Good Day to you! While a lot of us, when he begins to start competitive programming he found difficult to found problems on some topics in the beginning to practice of it, and same thing for a lot of ICPC Communites that they have started. These are some topic not advanced and videos, problems and articles on them. <br> <spoiler summary="Prefix Sum & Frequency Array"> [Wonderful Coloring](https://codeforces.me/contest/1551/problem/B1) [Do Not Be Distracted](https://codeforces.me/contest/1520/problem/A) [Letter](https://codeforces.me/problemset/problem/43/B) [Pangram](https://codeforces.me/problemset/problem/520/A) [Andryusha and Socks](https://codeforces.me/contest/782/problem/A) [Count Numbers](https://codeforces.me/group/c3FDl9EUi9/contest/262795/problem/A) [Count Characters](https://codeforces.me/group/c3FDl9EUi9/contest/262795/problem/B) [Range Sum Query](https://codeforces.me/group/c3FDl9EUi9/contest/262795/problem/E) [Count a's](https...
Round 3">Frogs and mosquitoes , ="Codeforces Round 330 (Div. 1)">REQ

Full text and comments »

  • Vote: I like it
  • +23
  • Vote: I do not like it

20.
By tomcat, 15 years ago, In Russian
Задача 330 с sgu <p><a href="http://acm.sgu.ru/problem.php?contest=0&amp;problem=330">http://acm.sgu.ru/problem.php?contest=0&amp;problem=330</a><br /></p><div><br /></div><div>Если кто-нибудь знает, как решается данная задача, пожалуйста расскажите решение.</div><div>Пока есть только идея говорить Impossible, если хотя бы одно из чисел простое, иначе действовать жадно и на каждом шаге прибавлять наибольший делитель текущего числа и B, не равный самому текущему числу. &nbsp;</div>
Задача 330 с sgu, http://acm.sgu.ru/problem.php <http://acm.sgu.ru/problem.php?contest=0&problem=<B>330</B>>

Full text and comments »

Tags sgu
  • Vote: I like it
  • +12
  • Vote: I do not like it

21.
By Serikbay777, history, 4 years ago, In Russian
Республиканская Олимпиада по информатике 2023 [2022](https://codeforces.me/blog/entry/102044) [2021](https://codeforces.me/blog/entry/90111) [2020](https://codeforces.me/blog/entry/80808) [2019](https://respa.daryn.kz/) [2018](https://codeforces.me/blog/entry/58432) [2017](https://codeforces.me/blog/entry/51416) **9 класс** | *Место* | *ФИО* | *CF handle* | *Балл* | *Медаль*| |----------|----------|----------| | 1 | Иса Ахмет | [user:Issa,2023-03-23] | 388 | ![ ](https://codeforces.me/predownloaded/93/73/9373156f429b185ba6bc779f81d16894f9a72d9e.png)| | 2 | Мамадахунов Мансур | [user:Wansur,2023-03-23] | 374 |![ ](https://codeforces.me/predownloaded/93/73/9373156f429b185ba6bc779f81d16894f9a72d9e.png) | | 3 | Асланов Амир | [user:Aslanov,2023-03-23] | 330 | ![ ](https://codeforces.me/predownloaded/93/73/9373156f429b185ba6bc779f81d16894f9a72d9e.png)| | 4 | Серазитдинов Назар | [user:Otalp,2023-03-23]| 316 |![ ](https://codeforces.me/predownloaded/93/73/9373156f429b185ba6bc779f81d16894f9a72d9e.png)...
| Асланов Амир | [user:Aslanov,2023-03-23] | 330 | ![ ](https://codeforces.me/predownloaded/93/73, ) | | 3 | Асланов Амир | [user:Aslanov,2023-03-23] | 330 | ![ ](https://codeforces.me/predownloaded/93

Full text and comments »

  • Vote: I like it
  • +55
  • Vote: I do not like it

22.
By Sammarize, 13 years ago, In Russian
Об оценке минусов Итак, давайте поговорим о том, как следует оценивать штрафные попытки по задачам. Толчком к подобным размышлениям служит следующая мысль. С точки зрения "качества программирования", если можно так выразиться, есть большая разница между задачей, сданной с первой же попытки и задаче, сданной после одной неверной попытки. Тогда как сдана задача с 10 или 11 попытки &mdash; существенной разницы нет. Однако же, разница в баллах сейчас одна и та же: 50 баллов (если, конечно, стоимость задачи ещё не опустилась до 30% стоимости задачи). В связи с этим, есть следующее конструктивное предложение: сделать стоимость минусов убывающей. Например, если задача имеет стоимость 1000, это может выглядеть так: <table> <tr><td>номер попытки</td><td>штраф за минус</td><td>суммарный штраф</td></tr> <tr><td>1</td><td>100</td><td>100</td></tr> <tr><td>2</td><td>79</td><td>179</td></tr> <tr><td>3</td><td>62</td><td>241</td></tr> <tr><td>4</td><td>50</td><td>291</td></tr> <tr><td>5</td><td>39</td><...
241 450291 539330, >330 725386 1012432

Full text and comments »

  • Vote: I like it
  • +16
  • Vote: I do not like it

23.
By backo, history, 11 years ago, In English
Updating g++ Hello! Can anyone tell me how to update my g++ compiler for C++ to the exact version that's used by the judge on codeforces? I'm using Windows 7 and I'm not using any IDE (i compile from the commandline). Currently I have g++ version 4.8.1 and I can't find where to download 5.1.0. Tried to download minGW but it keeps installing the old 4.8.1 version. Before, I didn't care that the compiler versions didn't match, but this last competition (330 div 2) got me really pissed off. I figured out the solution to the B problem, but I kept getting WA on pretests. After the contest, I tried submitting the solution and I saw that my solution was giving the wrong answer on their machine, while I was getting the corrent answer on my PC. After some tweaking I figured it was the pow() function that was causing the trouble. After i manually calculated 10^k instead of calling pow(10,k), I got accepted. This thing with different compiler versions is REALLY annoying and unpredictable because god ...
versions didn't match, but this last competition (330 div 2) got me really pissed off. I figured out, Before, I didn't care that the compiler versions didn't match, but this last competition (330 div 2

Full text and comments »

  • Vote: I like it
  • +5
  • Vote: I do not like it

24.
By a_shayaan, history, 11 years ago, In English
Getting Runtime error during submission C++ I am getting below run time for test case 21 error in Codeforces, it works perfectly for all the test cases before it and code works as expected in my local compiler. Time: 0 ms, memory: 0 KB Verdict: RUNTIME_ERROR I submitted my code for : http://codeforces.me/problemset/problem/330/A[submission:14005523] ~~~~~ #include<iostream> #include<algorithm> #include<string> using namespace std; int main(){ int n,m; cin>>n>>m; char array[n][m]; int i,j; char read; for(i=0;i<n;i+=1){ for(j=0;j<m;j+=1){ cin>>read; array[i][j]=read; } } int count=0; int tc=0; for(i=0;i<n;i+=1){ tc=0; for(j=0;j<m;j+=1){ if(array[i][j] == 'S'){ tc=0; break; } else tc+=1; } if(tc == 0) continue; else{ for(j=0;j<m;j+=1){ array[i][j]='E'; } count+=tc; } } for(i=0;i<m;i+=1){ tc=0; for(j=0;j<n;j+=1){ if(array[j][i] == 'S'){ tc=0; break; } else if(array[j][i] ==...
Verdict: RUNTIME_ERROR I submitted my code for : http://codeforces.me/problemset/problem/330/A, I submitted my code for : http://codeforces.me/problemset/problem/330 /A[submission:14005523]

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

25.
By Ahmed_Mohamed_Al3adl, history, 19 months ago, In English
Karatsuba algorithm # Karatsuba algorithm When we need to multiply 2 huge numbers, like 12093 * 23801, we can use the normal way we learned in school, which will cost nearly O(n^2), because each number should multiply with the other numbers. So if you have two big integers with a length of 100, it will cost you 10000 multiplication operations. **Karatsuba algorithm** is more optimizer because it cost *O(n^1.58)*. ## The logic behaind the *Karastuba Algorithm* - Let's imagine we have a number with 2 digits like "23". - We split the number into 2 parts: 2 and 3, we will call them a *AND* b. - Now a = 2 and b = 3, and the original number = a * 10 + b; - If we say that n is the length of the digit, then our original number is: a * 10^n/2 + b; - If you confused you can calculate: a = 2, b = 3, n = 2 (the integer length) *so* 2 * 10^1 + 3 = 23. - If we call our "23" number with **x**, we need to multibly it with another number **y** = 59. - We will split **y** also so: c = 5, and d = 9; and y = c * ...
= 10 * 100 + 10 * 33 + 27 = 1000 + 330 + 27 = 1330 + 27 = 1357 - And yeah, this is the right answer, )) + 10^(2/2) * 33 + 27 = 10 * 100 + 10 * 33 + 27 = 1000 + 330 + 27 = 1330 + 27 = 1357 - And yeah

Full text and comments »

  • Vote: I like it
  • -28
  • Vote: I do not like it

26.
By Wansur, history, 3 years ago, In Russian
Результаты Республиканской Олимпиады по Информатике 2024 Это результаты республиканской олимпиады по информатике 2024 ([user:Kazakhstan,2024-02-20]) <spoiler summary="Результаты прошлых лет"> [2023](https://codeforces.me/blog/entry/114266) [2022](https://codeforces.me/blog/entry/102044) [2021](https://codeforces.me/blog/entry/90111) [2020](https://codeforces.me/blog/entry/80808) [2019](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2019) [2018](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2018) [2017](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2017) </spoiler> 9 класс ----------- <table> <thead> <tr> <th>Место</th> <th>ФИО</th> <th>CF handle</th> <th>1 тур</th> <th>2 тур</th> <th>общий</th> <th>Медаль</th> </tr> </thead> <tr> <td> 1 </td> <td> Мамадахунов Мансур </td> <td> [user:Wansur,2024-03-26] </td> <td> 282.07 </td> <td> 181 </td> <td> 463.07 </td> <td> <img alt=" " src="/predownloaded/93/73/9373156f429b185ba6bc779f81d16894f9a7...
[user:k1ngash,2024-03-26] 195 135 330 , > Кигаш Амир [user:k1ngash,2024-03-26] 195 135 330

Full text and comments »

  • Vote: I like it
  • +137
  • Vote: I do not like it

27.
By I_am_Drew, history, 7 years ago, In Russian
Amazing contest!! I solved all problems in this first contest of Div 4!!! I'm so happy about it!!! Officially, I have the 12 place in official list of participants! Predictor says that I will have +330 rate!!! Amazingg~!!!!! Love you, Mike Mirzayanov!!!!! P.S. Mike made my dreams come true!!! I really want T-shirt with your autograph, cause you are my superstar!!!
, I have the 12 place in official list of participants! Predictor says that I will have +330 rate, Predictor says that I will have +330 rate!!!

Full text and comments »

  • Vote: I like it
  • +23
  • Vote: I do not like it

28.
By MikeMirzayanov, history, 6 years ago, In English
Codeforces Global Rounds 2020: Current Results (GR7-GR10) In 2020 (as in 2019), with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds will be held. These will be common rounds for both divisions of 7–9 problems each. The duration of the rounds will be 2-3 hours, depending on the number and complexity of the problems. All such rounds will be rated for all participants. <i>At each such round, 50 brand T-shirts will be handed out, and we will be happy to give T-shirts to all problem authors and problem testers.</i> 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 sweatshirts and place certificates. Current standings after four rounds (sorted by total points in four rounds): | Place | Contestant | = | GR 7 | GR 8 | GR 9 | GR 10| |--|--|--|--|--...
| 153 | — | — | 186 | | 49 | [user:qwerty787788,2020-08-18] | 330 | — | &mdash, ; | 186 | | 49 | [user:qwerty787788,2020-08-18] | 330 | — | — | 39 | 291 | | 49

Full text and comments »

  • Vote: I like it
  • +82
  • Vote: I do not like it

29.
By MStrechen, 10 years ago, translation, In English
Results of Ukrainian olympiad in informatics #### XXXth Ukrainian Olympiad in Informatics was held in Rivne from the second to the fifth of April [cut] You can see full results by [link](https://www.e-olymp.com/uk/news/87). #### The selection for the IOI will be held between the 18 best participants. By the way, one of them is 6th grade participant from Kharkiv :) #### Grade 11: <table> <tr> <th>First name, last name</th> <th>CF handle</th> <th>Real grade</th> <th>Points <br> (800 max)</th> <th>Place</th> <th>Will be on selection</th> </tr> <tr> <td>Stanislav Tomash</td> <td>~Stastomash,2017-04-09</td> <td>11</td> <td>705</td> <td><img src="http://codeforces.me/predownloaded/ba/0a/ba0a40082feeb796e0e231f487412a6e395df753.png"></td> <td>+</td> </tr> <tr> <td>Anton Tsypko</td> <td>~arsijo,2017-04-09</td> <td>11</td> <td>700</td> <td><img src="ht...
Lavrov 8 330 , > Bohdan Lavrov 8 330, >Запорожская обл. 8 330

Full text and comments »

  • Vote: I like it
  • +149
  • Vote: I do not like it

30.
By antirsi, 12 years ago, In English
Weird results when using GCC compiler While solving theCodeforces Round #192 (Div. 2), problem: (A) Cakeminator, I noticed that the output differs whenever I use the **gcc** compiler as opposed to the **microsoft** one. The solution was judged correct, but only when I used the microsoft c++ compiler. Here are the links to the two solutions: [gcc](http://codeforces.me/contest/330/submission/9284732) [msc++](http://codeforces.me/contest/330/submission/9284737) Can anyone point out what causes this weird behavior?
[gcc](http://codeforces.me/contest/330/submission/9284732), [msc++](http://codeforces.me/contest/330/submission/9284737)

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

31.
By Berryisbetter, history, 3 years ago, In English
The entire cses problem set sorted by the number of solvers! I could not find it online so I made it myself, I hope you will find it useful! Problem : Number of solvers - Weird Algorithm : 73338 - Missing Number : 62177 - Repetitions : 54281 - Increasing Array : 50436 - Permutations : 44614 - Distinct Numbers : 33154 - Dice Combinations : 32886 - Number Spiral : 31522 - Bit Strings : 29957 - Minimizing Coins : 28281 - Trailing Zeros : 28124 - Coin Combinations I : 26104 - Two Sets : 25446 - Coin Piles : 24696 - Apartments : 24318 - Removing Digits : 24291 - Two Knights : 23643 - Grid Paths : 23168 - Ferris Wheel : 23109 - Counting Rooms : 22561 - Palindrome Reorder : 22339 - Coin Combinations II : 22133 - Sum of Two Values : 21004 - Maximum Subarray Sum : 20797 - Book Shop : 20376 - Creating Strings : 19359 - Building Roads : 19197 - Restaurant Customers : 18982 - Concert Tickets : 18507 - Apple Division : 18503 - Stick Lengths : 18339 - Movie Festival : 17839 - Message Route : 16337 - Building Teams : 1578...
- Coin Grid : 347 - Increasing Array II : 346 - One Bit Positions : 330 - Visiting Cities : 329, Connectivity : 347 - Coin Grid : 347 - Increasing Array II : 346 - One Bit Positions :330 - Visiting

Full text and comments »

  • Vote: I like it
  • +28
  • Vote: I do not like it

32.
By ologn_13, 14 years ago, In English
Problem Longlongnim SRM 330 DIV 1 Hi! [this](http://community.topcoder.com/stat?c=problem_statement&pm=6856) is an SRM problem on topcoder..i tried solving it using the property of periodicity of wins 'W' and loses 'L' along with the property that result for a particular position(number of coins left) depends on atmost k position back..k is the maximum number of coins a player can pick..my question is how to decide the periodic length "q" for a given set moves[]..so that I will not iterate all over to MAXN and just use periodicity of this string with length "q"..
Problem Longlongnim SRM 330 DIV 1

Full text and comments »

  • Vote: I like it
  • +3
  • Vote: I do not like it

33.
By hell_hacker, history, 11 years ago, In English
Help with star graph ! In this question http://codeforces.me/contest/330/problem/B I want to ask why the star graph would give minimum number of paths. Thank You.
In this question http://codeforces.me/contest/330/problem/B I want to ask why the star graph would

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

34.
By PavelKunyavskiy, 12 years ago, In Russian
IOI 2014: второй тур Примерно через 5 минут по плану должен начаться второй тур IOI 2014. Полезные ссылки: [Результаты](http://live.ioi2014.org/Ranking.html) [Результаты от снарка](http://ioi.snarknews.info/index.cgi?data=2014/day1pre&class=ioi2014&year=2014) [Видеотрансляция](http://new.livestream.com/accounts/9099718/ioi2014day2) [Таблица по странам от Снарка](http://ioi.snarknews.info/index.cgi?data=2014/day1cou&class=ioi2014&year=2014) [Блог про первый день](http://codeforces.me/blog/entry/13052) Меня попросили не выкладывать условие, пока не будет официальной версии на сайте олимпиады, но обещали сделать ее существенно быстрее, чем на первом туре. Увидим. Для тех кто не следил за первым туром напоминаю: есть 6 полных баллов, 1 261, и 19 256. Количество золотых медалей &mdash; то ли 26, то ли 27. То есть борьба за них будет достаточно суровой. 0:00 Ух ты. И правда быстро выложили. 0:05 Пока ничего не произошло. Я пока пишу какие-то мысли про задачи. 0:12 Еще како...
holidays. Границы на текущий момент 447-330-209. 4:37 Кажется таблице опять плохо. 4:43 Еще 300, :32 ~zemen,2014-07-17 47 по holidays. Границы на текущий момент 447-330-209. 4:37 Кажется таблице

Full text and comments »

  • Vote: I like it
  • +59
  • Vote: I do not like it

35.
By MikeMirzayanov, 6 years ago, In English
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...
; | — | 122 | — | 211 | — | | 64 | [user:qwerty787788,2020-12-08] | 330 | &mdash

Full text and comments »

  • Vote: I like it
  • +317
  • Vote: I do not like it

36.
By ShafinKhadem, history, 6 years ago, In English
Codeforces rating distribution over time I was curious about rating inflation, so I generated a json object containing counts and percentiles and some plots of codeforces rating distribution over months, only counting active contestants: <spoiler summary="Json object"> ``` { "2015-01-01": { "Active": { "count": 21827, "percentile": 0.0 }, "Expert+": { "count": 6763, "percentile": 69.01543959316443 }, "CM+": { "count": 1778, "percentile": 91.85412562422688 }, "M+": { "count": 724, "percentile": 96.68300728455583 }, "IM+": { "count": 236, "percentile": 98.91877033032483 }, "GM+": { "count": 124, "percentile": 99.43189627525541 }, "IGM+": { "count": 21, "percentile": 99.90378888532551 }, "LGM": { ...
, "percentile": 96.96871976781684 }, "IM+": { "count": 330

Full text and comments »

  • Vote: I like it
  • +111
  • Vote: I do not like it

37.
By both_stars, history, 6 years ago, In English
doubt Can someone help me in this question https://codeforces.me/contest/330/problem/D (give some idea to solve or easy code to understand)
Can someone help me in this question https://codeforces.me/contest/330 /problem/D (give some idea

Full text and comments »

  • Vote: I like it
  • -26
  • Vote: I do not like it

38.
By Akshito, history, 11 years ago, In English
TLE on 330D cannot figure out why TLE on http://codeforces.me/contest/330/problem/D I have tried everything (but switch to C++) here is code: http://codeforces.me/contest/330/submission/11660881
cannot figure out why TLE on http://codeforces.me/contest/330/problem/D, here is code: http://codeforces.me/contest/330/submission/11660881

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

39.
By qweasdanan, 14 years ago, In English
replica watches for sale When it involves the rolex GMT-Master, it's the foremost incomparable and versatile fake omega watches model that has captivated the attentions of thousands <a href="http://www.alsowatches.org/rolex.html" title="fake rolex">fake rolex</a> of individuals within the world nowadays. Rolex Greenwich Mean Time Master may be a reasonably watch that isn't solely terribly strong however completely good in its quality on the far side your imagination. this is often a worthy designer watch. presently rolex Greenwich Mean Time Master Watch is appropriate for each men and girls. it's an expensive kind of watch which might be simply created up with extremely sturdy however value effective materials. It is bought at intervals economical rate. At <a href="http://www.alsowatches.org/chronographe.html" title="chronograph watches">chronograph watches</a> the <a href="http://www.alsowatches.org/daniel-jean-richard.html" title="daniel jean richard watches">daniel jean richard watches</a> current time, th...
330-WH7801-popular.html <http://www.alsowatches.org/Maurice-Lacroix-Pontos-PT6257-SS001-<B>

Full text and comments »

  • Vote: I like it
  • -19
  • Vote: I do not like it