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 Seyaua, 7 years ago, In English
Rockethon 2015 Announcement <a href="http://rocketfuel.com/"><img src="http://assets.codeforces.com/images/rockethon/HZ-LOGO-TAG-RGB-big.png" style="float:right;margin:0 2em 2em 2em;"/></a> Hello Codeforces community, I am happy to announce that [Rocket Fuel Inc.](http://rocketfuel.com/) will be hosting a Rockethon competition again! The contest is prepared by Rocket Fuel employees Eldar Bogdanov, Anton Lomonos, Lasha Lakirbaia, Alexander Ruff, Nikhil Goyal and me, Ievgen Soboliev. We hope everyone will find some interesting problems in the contest and everyone will have as much fun solving these problems as we had preparing them. Just like last year, the best participants will receive valuable prizes and top performers will get Rockethon 2015 T-shirts! Also, Rocket Fuel is interested in hiring people after this event, so please fill out the simple form during registration. About Rocket Fuel --------------------- Rocket Fuel is building technology platform to do automatic targeting and optimization of a...

Read more »

Announcement of Rockethon 2015
 
 
 
 
  • Vote: I like it
  • +607
  • Vote: I do not like it

 
 
 
 
2.
By PR_0202, 3 months ago, In English
[Discussion] Resume Projects Ideas Hello everybody! I am a Computer Science undergraduate currently in my 2nd year and want to develop some projects. I know other developments like android dev or web dev, but I want to do a project related to cp in which I can apply some algorithms. I searched on the internet but found projects like sudoku solver and pathfinder that are too common nowadays, and It would be great if you can share your ideas and previous projects related to CP... I would be too grateful to you! Thanks...
[Discussion] Resume Projects Ideas

Read more »

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

 
 
 
 
3.
By worstesttest, history, 22 months ago, In English
masterpiece.txt Bee Movie Script According to all known laws of aviation, there is no way a bee should be able to fly. Its wings are too small to get its fat little body off the ground. The bee, of course, flies anyway because bees don't care what humans think is impossible. Yellow, black. Yellow, black. Yellow, black. Yellow, black. Ooh, black and yellow! Let's shake it up a little. Barry! Breakfast is ready! Ooming! Hang on a second. Hello? - Barry? - Adam? - Oan you believe this is happening? - I can't. I'll pick you up. Looking sharp. Use the stairs. Your father paid good money for those. Sorry. I'm excited. Here's the graduate. We're very proud of you, son. A perfect report card, all B's. Very proud. Ma! I got a thing going here. - You got lint on your fuzz. - Ow! That's me! - Wave to us! We'll be in row 118,000. - Bye! Ba...
I see from your resume that you're devilishly handsome, Ken, Barry was looking at your resume,, Oheck out my new resume. I made it into a fold-out brochure., Put that on your resume brochure.

Read more »

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

 
 
 
 
4.
By ICPCNews, 5 months ago, In English
ICPC Quantum Computing Challenge <img src="/predownloaded/49/1f/491fff27090e0ef672d0e913d70cfc9a7a08dc91.jpg" align="right" style="height: 270px; margin: 10px 30px 20px;" alt="text"/> Boost your resume while applying your existing algorithmic skills to a new area! Gain valuable knowledge by joining us for the first ICPC Quantum Computing Challenge, sponsored by IBM Quantum. Starting on [February 24th at 12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20210224T12&p1=224) PST, this four-day global programming contest will provide an introduction to quantum computing and tools for developers to dig deeper into this field. 1. Register [here](https://challenges.quantum-computing.ibm.com/icpc) by Tuesday, [February 23 at 5:00 PM](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20210223T17&p1=224) Pacific Time (PT) <center style="margin: 1.5em;"> <a href="https://challenges.quantum-computing.ibm.com/icpc" style="text-decoration: none;font-size: 18.0px;background-color: rgb(207, 56, ...
Certification or on your resume or CV several weeks after the contest., ="height: 270px; margin: 10px 30px 20px;" alt="text"/> Boost your resume while applying your, Boost your resume while applying your existing algorithmic skills to a new area!

Read more »

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

 
 
 
 
5.
By Sharon, history, 3 years ago, In English
A Public Apology (+Compensation) The Introduction ---------------- On March 32nd of this year I created a blog post to share some new coding techniques that are quite easy to code and serve as very powerful optimizations (Context: [https://codeforces.com/blog/entry/58667](https://codeforces.com/blog/entry/58667)). Now of course I know I single-handedly transformed the competitive programming meta as problems had to be done according to new standards now that it is possible to make O(N) code work O(1). Super fast. However, I have to share an upsetting discovery that I made. This blog post might be too sad for you, so discretion is advised. I have added certain checkpoints within this post where you can take a break if you get too sad and you may resume reading later. I have also added some cute pictures of animals to help out with your sadness. The Story --------- It all started yesterday, when I used my usual O(1) trick to O(N) trick on problem E2 from the last contest (It seems that Mirzayanov has not a...
a break if you get too sad and you may resume reading later. I have also added some cute pictures, if you get too sad and you may resume reading later. I have also added some cute pictures of animals

Read more »

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

 
 
 
 
6.
By EnumerativeCombinatorics, history, 3 years ago, In English
Applying for PhD in CS: Is it possible for competitive programmers with no CS-related degrees? Hello, I am majoring in theoretical ecology at the University of Tokyo. I am scheduled to graduate from the current MSc program in March 2020, and I am planning to get in a Ph.D. program (outside Japan, due to financial and other problems). My interests are mathematical/computational biology/ecology, combinatorics, graph theory, exponential algorithms, etc. Currently, my biggest concern is that I have no CS degrees, or even something related to CS. I graduated from the University of Tokyo in ecology BSc. However, I have achievements and contributions in competitive programming area more than average (How 'more than average'? This is my list [Link](https://tozangezan.github.io/)). Is it possible for non-CS students with competition achievements like me to get in CS PhD program to research algorithms? How are the chances? Does it depend on schools or region? I have no one to ask about it because almost all the redcoders are CS or mathematics major, and especially in Japan, very ...

Read more »

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

 
 
 
 
7.
By dark04, history, 12 months ago, In English
Helping Students Struggling in Placements and Internships Hello Codeforces, As resumes are your first impression to the company, all of us want to put our best effort to prepare a FANNG worthy resume which can attract the recruiters to get shortlisted for top tech companies like Google, Facebook, Amazon, Microsoft, Apple, Goldman Sachs etc. We have prepared a video in which we discuss all the tips and tricks required to create such a resume. We also have shown a resume which get shortlisted for Google, Microsoft, Goldman Sachs, Tower Research, Amazon and D E Shaw. In this video we have discussed the important components that every resume must-have. It will clear all your doubts related to: The best platform to design your resume. What should be the length of the resume? How many projects are good to write? Do the extra curricular activities matter for the coding interviews? We hope you will like the content and experiences shared. Do like and share the post so that this video can reach and help as many people as possible. [L...
our best effort to prepare a FANNG worthy resume which can attract the recruiters to get shortlisted, such a resume. We also have shown a resume which get shortlisted for Google, Microsoft, Goldman Sachs, Tower, that this video can reach and help as many people as possible. [Link to the Resume Making Tutorial](https, to prepare a FANNG worthy resume which can attract the recruiters to get shortlisted for top tech companies, In this video we have discussed the important components that every resume must-have

Read more »

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

 
 
 
 
8.
By gammal-geniune, history, 5 years ago, In English
The famous egyptian underdog (A story of success.... A story of me) In the last few days , a lot of people were trying to impersonate me , AbdurRahman ElGammal. I think a lot of people in CF community asked themselves "Who is AbdurRahman ElGammal?" of course NO SURPRISE. Let me tell you about myself so you can know why all those people were impersonating me through these fake accounts. "They call me life coach or mentor, but I'm just a simple guy with some experience." As you can see , I am a coach. A really brilliant and amazing coach , the coach of most of Egyptian Legendary Grandmasters on CF like [user:bmerry,2016-06-10] , [user:Xellos,2016-06-10] , [user:Swistakk,2016-06-10] and [user:TsunamiNextYear,2016-06-10] , (and they're also red coders on TopCoder). Of course , My territory expands among a lot of countries (like Iraq , Yemen , Gabon and South Sudan). I think you're wondering why I am so humble and I am saying that I am just a simple guy !! I will tell you my story and you will judge. I was born in Silicon Valley in 1960. My house...
to make money. Well yeah, that's in my resume. You are probably asking why me, why not [user:fegla,2016, , that's in my resume. You are probably asking why me, why not [user:fegla,2016-06-10

Read more »

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

 
 
 
 
9.
By ItsNear, history, 4 years ago, In English
Making machines write and execute code #1: Neural programmer-interpreters Hi, everyone, As I mentioned in the last post, myself and a friend of mine got very interested in how close we can get machines to writing software, and whether modern advances in Deep Learning can help us build tools that considerably improve the way people write, review and debug code. I want to start a series of posts discussing some interesting advances in using machine learning for both writing and executing code. This particular post is about a machine learning model proposed early last year by Scott Reed from University of Michigan, then an intern at Google DeepMind, called <a href=https://arxiv.org/pdf/1511.06279.pdf>Neural Programmer-Interpreters</a>. But before I go into the details, I would like to start with an ask. CodeForces and similar websites today host a vast amount of data that we would love to use to train our machine learning models. A particular challenge is that problem statements historically contain a lot of unnecessary information in an attempt to ...

Read more »

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

 
 
 
 
10.
By Tampere, 4 months ago, In English
A note for my 200th virtual contest It is really a tough time for me to complete another 100 virtual contests (If you are interested, you could take a look at this [My advance and my thought, after completing about 100 virtual rounds](http://codeforces.com/blog/entry/56210), which I wrote several years ago). Once, I stopped competitive programming for a long time, and when I decided to start again, I found that I had forgot most of the advanced algorithms, data structure and tricks. I really suffered a lot when I resumed practicing, but anyway this has been the past and finally I struggled to conquer it. Although I really feel that I have improved a lot than before, however the fact is that my rating still goes down. I thought this should make me frustrated, but I find that I do not focus so much on rating as before, while instead, I start to enjoy competitive programming itself, solving problems, learning new techniques, and so on. Of course, obtaining higher rating is still my target, but keeping up practicing and l...

Read more »

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

 
 
 
 
11.
By Please_Meri_Gaand_Le_Lo, 7 weeks ago, In English
Babbar Bhaiya is on Discord ! Your path to success ! #### [Server Link](https://discord.com/invite/xuWZeP5rM7) Please join only if you have the guts to solve 450 DSA problems by geeksfo.. i mean sir love babbar. ### Strong Alumni Network Babbar Bhaiya has mentored over 1000+ students. Some of them are Sundar Pichai, Jeff Bezos, Steve Jobs and many more ### Learn from experience * Babbar Bhaiya bhaiya is the thekedar.. i mean the MVP in terms of DSA. No DSA Problem can be made without his approval. * It is a well known fact that all of the contest on Codeforces, Codechef have to be approved by Babbar Bhaiya * All strong coders from India consider him as a mentor, and refer to his roadmap when in doubt. ### Contribution to the community * Babbar Bhaiya will personally take your resume to the CEO at FAANG. He has "relations" with them. * Babbar Bhaiya once told a guy to become red and start doing YouTube and make videos on CP, that guy is our beloved [user:HealthyUG,2021-06-14]. * There are rumors that, [user:kshiti...
to the community * Babbar Bhaiya will personally take your resume to the CEO at FAANG. He has, * Babbar Bhaiya will personally take your resume to the CEO at FAANG. He has "relations" with them

Read more »

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

 
 
 
 
12.
By snacache, history, 5 years ago, In English
Help with some fractions operations Hi everybody! I recently was in a programming contest. There were 20 tasks, and one of them was as follows: In resume, you have C chairs and P pairs of chairs are given. The pairs $P(i,j)$ denote the probability of changing from chair $i$ to chair $j$. You are sitting in one of these chairs, and every second you have to move to another one. Then you have Q queries, each with two integers $C_i, s$ , where $C_i$ is the initial chair you are seated and you have to tell the chair that has the highest probability of being seated in after $s$ seconds (after $s$ changes). $1 \leq C_i \leq 50$ $1 \leq s \leq 100000000$ At first, I thought this was a simple problem, solvable using matrix exponentiation. First creating a matrix $M$, where $M_ij = P(i,j)$. The answer should be in the $C_i$ row of the resulting matrix $M^{ S}$, but the problem has the next important requirement: You have to output the probability as an irreducible fraction. Worst of all, you have to output ON...
was as follows: In resume, you have C chairs and P pairs of chairs are given. The pairs $P(i,j, In resume, you have C chairs and P pairs of chairs are given. The pairs $P(i,j)$ denote

Read more »

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

 
 
 
 
13.
By sidchelseafan, history, 5 years ago, In English
Unable to view complete user submission history on SPOJ Hello Codeforces community, I resumed solving SPOJ problems a week or so back. I have noticed that you're no longer able to view the complete user submission history (either normally or via signed list) for any user apart from yourself. This is an impediment. I personally look up to a few users and solve problems that they're solving( I'm sure there are many others like me) and also see what order the top/popular users have solved the problems in, this also spares me the trouble of spending time on finding good/challenging problems on SPOJ. I kindly request "top" users of SPOJ or just about anyone who has done a lot of SPOJ (a lot of means arbitrary lets just put 300-400+) and benefited from it to "try" and post their submission history (You could put your own signed list in a text file and host it on pastebin). It would be extremely helpful for newbie coders and for anyone who does a lot of SPOJ by following what other solve. Thanks. P.S. I have also sent a mail to SPOJ expl...

Read more »

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

 
 
 
 
14.
By aajjbb, 8 years ago, In English
A* Optimization Hello, I'm trying to solve this problem [Link](http://br.spoj.com/problems/RAPREGUI/). The problem statement is available in [LiveArchive](https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=&problem=1653&mosmsg=Submission+received+with+ID+1253271) in English. In the Brazilian SPOJ, the time-limit is quite strict, as the problem resumes to a grid shortest path, I choose the A* algorithm, which generally is faster than Djikstra and it's heuristics fits perfectly in 2-dimensional grids, but my solution isn't fast enough. How can I optimize more the A* ? The current code is: ~~~~~ struct MyLess { bool operator () (int x, int y) { return f[x] > f[y]; } }; int func (void) { int i, j; dist[conv(RF,CF)] = 0; vis[conv(RF,CF)] = 0; priority_queue<int, vector<int>, MyLess> q; q.push(conv(RF, CF)); for ( ; !q.empty(); ) { int now = q.top(); q.pop(); if (vis[n...

Read more »

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

 
 
 
 
15.
By Nuu, 4 years ago, In English
Smallest circle set points [Help] Hi guys, i'm trying solve this [problem](https://www.urionlinejudge.com.br/judge/en/problems/view/1455). The resume is: given a set of points, print the smallest circle that cover all points. I'm searching, but only find aproximate algorithms. Somebody know a algoritm without aproximate? Thanks for advice.
/1455). The resume is: given a set of points, print the smallest circle that cover all points, The resume is: given a set of points, print the smallest circle that cover all points.

Read more »

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

 
 
 
 
16.
By ayush242001, history, 9 months ago, In English
Chances of referral? If someone would end up at around 2100 rating at codeforces with some valuable projects at resume, what are the chances of getting a referral to a tech company? P.S. : I am asking from the context of Indian subcontinent, and I am really confused whether CP + Projects would be ideal for a student to get referred at big tech companies?
If someone would end up at around 2100 rating at codeforces with some valuable projects atresume

Read more »

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

 
 
 
 
17.
By vis10326, 7 years ago, In English
acm icpc certificates If we are unable to participate in onsite round of ACM ICPC REGIONALS , shall we be provided certificates for qualifying online round and can we write in our resume "Qualified ACM ICPC" and show those certificates as proof?
certificates for qualifying online round and can we write in our resume "Qualified ACM ICPC" and show

Read more »

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

 
 
 
 
18.
By ll931110, 9 years ago, In English
 
 
 
 
  • Vote: I like it
  • +26
  • Vote: I do not like it