enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Competitive programming - Wikipedia

    en.wikipedia.org/wiki/Competitive_programming

    A vast majority of problems appearing in programming contests are mathematical or logical in nature. Typical such tasks belong to one of the following categories: combinatorics, number theory, graph theory, algorithmic game theory, computational geometry, string analysis, discrete mathematics and data structures. [6]

  3. Codeforces - Wikipedia

    en.wikipedia.org/wiki/Codeforces

    He has used Codeforces problems in his class, 15-295: Competition Programming and Problem Solving. [20] At the National University of Singapore , Codeforces rating is also used as an entrance qualifying criterion for registering for a 4-unit course, CS3233 Competitive Programming, as students have to achieve a rating of at least 1559 to be able ...

  4. Makoto Soejima - Wikipedia

    en.wikipedia.org/wiki/Makoto_Soejima

    Codeforces peak rating 3115 Makoto Soejima ( 副島 真 , Soejima Makoto , born 1991) is a Japanese former competitive programmer . [ 1 ] He is one of three people to have won both the Google Code Jam and the Facebook Hacker Cup and the only one to have also won a gold medal with a perfect score at the International Mathematical Olympiad (IMO).

  5. Gennady Korotkevich - Wikipedia

    en.wikipedia.org/wiki/Gennady_Korotkevich

    Gennady Korotkevich (Belarusian: Генадзь Караткевіч, Hienadź Karatkievič, Russian: Геннадий Короткевич; born 25 September 1994) is a Belarusian competitive sport programmer who has won major international competitions since the age of 11, as well as numerous national competitions.

  6. International Mathematical Olympiad - Wikipedia

    en.wikipedia.org/wiki/International_Mathematical...

    Unlike other science olympiads, the IMO has no official syllabus and does not cover any university-level topics. The problems chosen are from various areas of secondary school mathematics, broadly classifiable as geometry, number theory, algebra, and combinatorics.

  7. Vieta jumping - Wikipedia

    en.wikipedia.org/wiki/Vieta_jumping

    In number theory, Vieta jumping, also known as root flipping, is a proof technique. It is most often used for problems in which a relation between two integers is given, along with a statement to prove about its solutions. In particular, it can be used to produce new solutions of a quadratic Diophantine equation from known ones.

  8. International Mathematical Olympiad selection process

    en.wikipedia.org/wiki/International_Mathematical...

    After the camp, an exam is given in each of the preceding topics to evaluate the skills. A number of students, usually 30, are selected to join another camp in March, known in Thailand as "POSN Camp 2". The topics include Algebra, Geometry, Number Theory, and Combinatorics in an advanced level, Functional Equation, and Inequality.

  9. International Olympiad in Informatics - Wikipedia

    en.wikipedia.org/wiki/International_Olympiad_in...

    The International Olympiad in Informatics (IOI) is an annual competitive programming competition and one of the International Science Olympiads for secondary school students. The first IOI was held in 1989 in Pravetz , Bulgaria.