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...
CodeForces community can help to address some of the issues the program synthesis community is facing, can help to address some of the issues the program synthesis community is facing today., natural language translation this is acceptable, but in Program Synthesis messing up one token most, Another great inspiring example of applying program synthesis from examples is a paper called, Microsoft Research has a long history of working on program synthesis. Here are two good, Notably, more traditional approaches from code synthesis (used primarily for programming by, Number of labs that work on program synthesis is actually rather small. Besides NEAR, here are, The area of research that is tasked with automated program generation is called Program Synthesis, The lack of data is also the primary reason why program synthesis is not a popular area of research, There were some applications of program synthesis from example in commercial products. Modern, Who works on Program Synthesis? ===============================, [Berkeley lab lad by Dawn Song](https://sunblaze-ucb.github.io/program-synthesis /index.html)

Full text and comments »

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

2.
Codeforces Round #488 by NEAR
By AlexSkidanov, history, 8 years ago, In English
Codeforces Round #488 by NEAR **UPD** note that the score distribution has changed **UPD2:** [user:LHiC,2018-06-17] found a bug in the author solution of div1-F. We are working on the situation. **UPD3:** we found a correct solution for div1-F and both submissions made during the contest pass all the tests against the correct solution. The round remains rated. Hi, everybody, Codeforces round 488 for both divisions will take place on [contest_time:993]. The round will be 2.5 hours long (which is 30 minutes longer than usual). The contest is created by [NEAR](http://near.ai/blog) and its friends. NEAR is working on teaching machines to compete in programming competitions. Read [our blog post](http://codeforces.me/blog/entry/59746) to learn more about the state of the art in the program synthesis today, our vision, and how you can help us bring this vision to reality. The contest will feature 6 problems for each division, with 4 problems shared across them. The problems for the contest are from t...
/entry/59746) to learn more about the state of the art in the program synthesis today, our vision, and, ://codeforces.com/blog/entry/59746) to learn more about the state of the art in theprogram synthesis today

Full text and comments »

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

3.
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

4.
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...
x| by proof this lemma: When we synthesis x with T1, T2, ..., Tk, p(x) <= 1 + p(T1) + ... + p(Tk

Full text and comments »

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

5.
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, -program synthesis

Full text and comments »

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