iakolzin's blog

By iakolzin, history, 4 years ago, translation, In English

Hi everyone!

I've been doing competitive programming for more than ten years, and for the last three I've been developing educational services. I'd like to create a service for learning algorithms and data structures. I think it could be useful for participants with rating up to 1500 who need to improve their algorithmic skills and need help from more experienced tutors. If that's you, please help me get a sense of how to go about doing this by filling out this Google Form.

I wish everyone a high rating, and a big thank you to everyone who responds :)

Full text and comments »

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

By iakolzin, 14 years ago, translation, In English
Good day!

Yesterday ACM-ICPC Moscow Subregional Programming Contest 2010 took place at Moscow State University and Moscow Institute of Physics and Technology. Our subregion is one of the strongest among those included to Northeastern European Region. Teams from our subregion are usually earn medals at World Finals. For example, team "MSU Unpredictable" earned gold medal and became European champions at the last Final (they named Moscow State University in the standings table).

So I think people who can't speak Russian might be interest in results and materials from Moscow Subregional Contest. Problems are in English only. Here are the main links:

Main site

Final standings

Problems

By the way, our team named "MIPT Guinness" successfully participated and is allowed to take part in Regional Contest =)

Full text and comments »

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

By iakolzin, 14 years ago, translation, In English

Contest discussion

Problem А. Second Order Statistics

Sorting

In this problem one should find a minimal element from all elements, that are strictly greater, then the minimal one or report that it doesn't exist. Of course, there can be a lot of different solutions, but one of the simplest - to sort the given sequence and print the first element, that's not equal to the previous. If all elements are equal, then the required element doesn't exist.

Full text and comments »

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