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.
Are we close to machines solving ICPC problems?
By AlexSkidanov, history, 8 years ago, In English
Are we close to machines solving ICPC problems? Hi, all, I with few other folks at [NEAR](http://near.ai/blog) work on teaching machines to program. A particularly exciting sub-project of that is teaching machines to solve competitive programming problems. In this post I would like to give a quick overview of where the state of the art is today, what the major challenges are, why this is not a popular area of research, and how the CodeForces community can help to address some of the issues the program synthesis community is facing today. We also have a certain budged allocated for this project, and we are paying to the CodeForces members who help us with some data annotation challenges. We have paid more than $10k in our first two annotation projects, and are launching three more projects today. Scroll to the end if you are interested. Competitive programming as a benchmark ====================================== With the emergence of deep learning, neural networks started performing almost at a human level in many ta...
likely leads to a completely wrong program. Notably, more traditional approaches fromcode synthesis, trained well. If a model predicts code one token at a time, and a code snipped comprises 200 tokens, Notably, more traditional approaches from code synthesis (used primarily for programming by

Full text and comments »

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

2.
Codeforces Round #190 — Editorial
By cgy4ever, 13 years ago, In English
Codeforces Round #190 — Editorial **Update 1** Added links to my code. **Update 2** The links to my code seems not work, so I push my codes on github, and you find all of them here: [https://github.com/cgy4ever/cf190](https://github.com/cgy4ever/cf190) **Update 3** Fixed my solution of Div1-C (Div2-E). In this problem, we must find [centroid of tree](http://acm.sgu.ru/problem.php?contest=0&problem=134) instead of [center of tree](http://stackoverflow.com/questions/4020122/finding-center-of-the-tree). Thanks [user:RomaWhite,2013-07-03] for pointing this out and provide test case. And it seems that many solutions can pass the system test will fail on his test case (including my model solution). I feel apologetic for the weak test cases and wrong solution. **Update 4** Reformat the passage, I hope it would looks better. [problem:322A] Let's define remainNew = # of people haven't danced before. So at beginning remainNew = n+m, and we have: - During the 1st song, remainNew must decreased by at least 2. (B...
**Update 1** Added links to my code. **Update 2** The links to my code seems not work, so I push

Full text and comments »

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

3.
Time Complexity Reduction
By LashaBukhnikashvili, history, 8 years ago, In English
Time Complexity Reduction Hello, I'm working on Audio Algorithm: Pitch-Shifter, unfortunately I can't find Text material about it design, But I found one of the code, implemented on c#: [pastebin link](https://pastebin.com/gsvBunqX). I would post code here as well, and if you have any idea how I can reduce time or implement new one, please share it, Thanks in advance. ~~~~~ /**************************************************************************** * * NAME: PitchShift.cs * VERSION: 1.2 * HOME URL: http://www.dspdimension.com * KNOWN BUGS: none * * SYNOPSIS: Routine for doing pitch shifting while maintaining * duration using the Short Time Fourier Transform. * * DESCRIPTION: The routine takes a pitchShift factor value which is between 0.5 * (one octave down) and 2. (one octave up). A value of exactly 1 does not change * the pitch. numSampsToProcess tells the routine how many samples in indata[0... * numSampsToProcess-1] should be pitch shifted and moved to outdata[0 ... * numSampsToProc...
about it design, But I found one of the code, implemented on c#: [pastebin link](https://pastebin.com

Full text and comments »

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

4.
BFS DP problems?
By KarimElSheikh, history, 11 years ago, In English
BFS DP problems? There are some few problems I came across like [Fish](http://codeforces.me/problemset/problem/16/E) and [Virus synthesis](http://codeforces.me/gym/100543) which seem to have solutions with BFS traversal and typical DP minimization/maximization function. I want to practice this technique because normally when I think of coding a DP solution I only think of DFS traversal, any ideas of problems which are best solved using this technique? EDIT: Just a clarification this DP style is usually a "Reverse" BFS Traversal of the states where we travel from the leaf nodes upwards level by level and converge to the final state
) and [Virus synthesis](http://codeforces.me/gym/100543) which seem to have solutions with BFS

Full text and comments »

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

5.
Eertree (Palindromic Tree) — Comprehensive Resource Guide
By Sangeet.cpp, history, 13 months ago, In English
Eertree (Palindromic Tree) — Comprehensive Resource Guide Hi Codeforces! During Codeforces Round 1059 (Div. 3), I encountered **Problem E: Beautiful Palindromes**, which involves minimizing palindromic subarrays. While researching optimal solutions, I discovered the **Eertree (Palindromic Tree)** data structure — a powerful but relatively unknown tool for efficiently handling palindrome-related problems. The Eertree can process all palindromic substrings of a string in **O(n)** time and space, making it ideal for problems involving palindrome counting, queries, and optimizations. However, I noticed there are limited and scattered resources for learning this data structure, so I've compiled this comprehensive guide to help the community. ### What is an Eertree (Palindromic Tree)? The **Palindromic Tree** (also called **Eertree**) is a tree-like data structure that stores all unique palindromic substrings of a string efficiently. It was introduced by Mikhail Rubinchik and Arseny M. Shur in 2014. **Key Properties:** - Proc...
) 4. **Virus synthesis** [Codeforces GYM](https://codeforces.me/gym/100548/attachments) 5

Full text and comments »

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

6.
New Educational Institution
By TepegjozovEDUCATION, history, 6 years ago, In English
New Educational Institution Hi Codeforces! We are eager to announce our educational institution and show you our mission and services. Our mission is to create a collaborative environment amongst the most talented people in these fields and help those who want to learn but haven't got an opportunity yet. We are offering individual and group tutoring sessions on the following subjects: -competitive programming -algorithms and data structures -machine learning -program synthesis -preparation for physics olympiads -preparation for coding interviews -android app development If you are interested to learn any of these wonderful skills or become a mentor at our educational institution, please message me!
programming -algorithms and data structures -machine learning -program synthesis -preparation

Full text and comments »

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