e-maxx.ru
Registerede-maxx.ru - an authoritative resource on algorithms and Olympiad programming e-maxx.ru is one of the most famous and respected resources on the Russian-language Internet, dedicated...
e-maxx.ru Website screenshot
Website Description
e-maxx.ru - an authoritative resource on algorithms and Olympiad programming
e-maxx.ru is one of the most famous and respected resources on the Russian-language Internet, dedicated to algorithms, competitive programming and mathematics. The site is not just a collection of articles, but a full-fledged educational project that has been actively developing for more than ten years.
Key theme of the site
e-maxx.ru specializes in deep and detailed explanations of complex algorithms used both in scientific work and in programming competitions such as ACM ICPC, Codeforces, TopCoder and others. The main topics of the site include:
- Algorithms for finding the maximum matching (for example, Hungarian algorithm, Edmonds algorithm)
- Geometric algorithms (for example, finding an inscribed circle in a convex polygon using the “side compression” method)
- Data structures: segment tree, sqrt decomposition, heavy-light decomposition
- String processing algorithms: prefix function, search for tandem repetitions, suffix automata
- Methods for solving problems on graphs: search for bridges and articulation points, Prim's algorithm, Ford-Bellman algorithm
- Number theory and combinatorics: Eratosthenes’ sieve with linear time, Cayley’s formula, inclusion-exclusion principle
- Transformations: Fast Fourier Transform (FFT), Tatta matrix
Each article on the site is not just dry code, but a full explanation with theory, examples, step-by-step analyzes and links to tasks in online contests.
Site Features
e-maxx.ru is distinguished by high quality content. The site is regularly updated, which is confirmed by annual notes on innovations:
- In 2011, the article on the suffix machine was completely rewritten.
- New algorithms were added in 2012: Prüffer code, search for a pair of intersecting segments.
- Since 2011, links to real problems in online testing systems (for example, Codeforces, Timus) have been attached to each algorithm.
- In 2010, a forum was launched where complex topics, questions and ideas are discussed.
- Since 2010, an offline version of the site has been available in PDF format - more than 700 pages, regularly updated.
- Since 2009, code syntax highlighting has been implemented for all articles using the GeSHi engine.
The site is also distinguished by its attention to detail: errors are corrected, design is improved, illustrations are added, code is optimized. For example, in the article on Fast Fourier Transform a more efficient version of the code has been added.
Online resources and development
e-maxx.ru not only provides content, but also actively develops the ecosystem around itself:
- RSS feed allows you to subscribe to site news.
- Comments on articles are now possible through DISQUS, which promotes dialogue with the audience.
- Code formatting has been adapted to prevent Google Translate and Bing from mistranslating.
- The Wiki section was closed in 2011 due to high server load and low efficiency, which indicates the project's commitment to stability and quality.
The project is the result of many years of work by one or more authors who systematically update and improve the materials. The site has become a kind of “knowledge library” for students, schoolchildren, Olympiad participants and professionals.
Contact information
The texts provided do not contain contact information (email, telephone, company name).
Frequently asked questions
What is the topic of the site e-maxx.ru?
e-maxx.ru is a site on algorithms, Olympiad programming and mathematics. It contains detailed articles on complex algorithms, including graphs, strings, geometry, number theory, and transformations.
What new was added to the site in 2012?
In 2012, the following articles were added: “Prüfer Code”, “Searching for a Pair of Intersecting Segments”, “Hungarian Algorithm”. A comment system via DISQUS has also been introduced, and code formatting has been improved.
Which algorithms have been rewritten or improved?
The following were completely rewritten: the suffix automaton, the tree of segments, the system of disjoint sets, the search for bridges, the incircle in a convex polygon, as well as the Edmonds and Cayley algorithms.
Is there an offline version of the site?
Yes. Since 2010, a PDF version of the site has been available - more than 700 pages, regularly updated. The file can be downloaded from the website.
Can I use e-maxx.ru materials for study?
Yes. The site's materials are widely used by students, schoolchildren and participants in programming competitions as the main source of knowledge on complex algorithms.
Main Information
Server Information
Meta Tags List
- name: color-scheme content: light dark
Whois Information
Whois Raw Data
domain: E-MAXX.RU
nserver: ns1.1gb.ru.
nserver: ns2.1gb.ru.
nserver: ns3.1gb-ru.com.
state: REGISTERED, DELEGATED, UNVERIFIED
person: Private Person
registrar: RU-CENTER-RU
admin-contact: https://www.nic.ru/whois
created: 2008-06-07T20:00:00Z
paid-till: 2027-06-07T21:00:00Z
free-date: 2027-07-09
source: TCI
Last updated on 2026-06-12T00:28:01Z
Robots.txt
User-agent: *
Disallow:
SEO Audit
Technical SEO
On-Page SEO
Content and UX
Positions in Google
Search Phrases - Google
| Position | Phrase | Page | Snippet |
|---|---|---|---|
| 1 | /algo/gravity_center | ||
| 1 | / | ||
| 1(+14) | /algo/intersecting_s... | ||
| 1 | /algo/circle_line_in... | ||
| 2 | / | ||
| 2 | /algo/pick_grid_theo... | ||
| 2 | /algo/lines_intersec... | ||
| 2 | /algo/lines_intersec... | ||
| 2 | /algo/lines_intersec... | ||
| 2 | /algo/segments_inter... |
Positions in Yandex
Search Phrases - Yandex
| Position | Phrase | Page | Snippet |
|---|---|---|---|
| 21 | / | ||
| 26 | / | ||
| 32 | / |