|
Codeforces
Codeforces () is a website that hosts competitive programming contests. It is maintained by a group of competitive programmers from ITMO University led by Mikhail Mirzayanov. Since 2013, Codeforces claims to surpass TopCoder in terms of active contestants. As of 2019, it has over 600,000 registered users. On its 15th anniversary, Codeforces had a total of 1,692,402 users with at least one submission. Codeforces along with other similar websites are used by some sport programmers, like Gennady Korotkevich, Petr Mitrichev, Benjamin Qi and Makoto Soejima, and by other programmers interested in furthering their careers. Overview Codeforces is a platform where people generally practice competitive programming and it offers the following features: * Short (2-hours) contests, called "Codeforces Rounds", held about once a week * Educational contests (2-2.5 hours, with 12 hours (24 hours before Round 45) hacking period), held 2-3 times per month; * Challenge/hack other contestants' sol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Gennady Korotkevich
Gennady Korotkevich (, Hienadź Karatkievič, ; 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. Widely regarded as one of the greatest competitive sport programmers of all time, his top accomplishments include six consecutive gold medals in the International Olympiad in Informatics as well as the world championship in the 2013 and 2015 International Collegiate Programming Contest World Finals. As of October 2023, Korotkevich is the highest-rated programmer on CodeChef, Topcoder, and HackerRank. On 30th August 2024, he achieved a historic rating of 4009 on Codeforces, becoming the first to break the 4000 barrier. He was the highest-rated programmer on Codeforces until 20 January 2024. Biography Korotkevich was born in Gomel (Homiel), southeastern Belarus. His parents, Vladimir and Lyudmila Korotkevich, are programmers in the mathematics depa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Makoto Soejima
is a Japanese former competitive programmer. 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). In International Science Olympiads, he has won three gold medals and one bronze in the International Mathematical Olympiad as well as two silver medals in the International Olympiad in Informatics (IOI). Biography Soejima was born in 1991. He began competitive programming in 1999. He attended Junior and Senior High School at Komaba, University of Tsukuba. During his time at junior and senior high school, he participated in the IMO multiple times (2005, 2007–2009) where he obtained three gold medals and one bronze. On his final attempt in 2009, he achieved a perfect score. At the same time, Soejima also participated in the 2008 and 2009 IOI where he obtained a silver medal both times. Soejima then attended The Univers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Q Sharp
Q# (pronounced ''Q sharp'') is a domain-specific programming language used for expressing quantum algorithms. It was initially released to the public by Microsoft as part of the Quantum Development Kit. Q# works in conjunction with classical languages such as C#, Python and F#, and is designed to allow the use of traditional programming concepts in quantum computing, including functions with variables and branches as well as a syntax-highlighted development environment with a quantum debugger. History Historically, Microsoft Research had two teams interested in quantum computing: the QuArC team based in Redmond, Washington, directed by Krysta Svore, that explored the construction of quantum circuitry, and Station Q initially located in Santa Barbara and directed by Michael Freedman, that explored topological quantum computing. During a Microsoft Ignite Keynote on September 26, 2017, Microsoft announced that they were going to release a new programming language geared spe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
International Collegiate Programming Contest
The International Collegiate Programming Contest (ICPC) is an annual multi-tiered competitive programming competition among the universities of the world. Directed by ICPC Executive Director and Baylor Professor William B. Poucher, the ICPC operates autonomous regional contests covering six continents culminating in a global World Finals every year. In 2018, ICPC participation included 52,709 students from 3,233 universities in 110 countries. The ICPC operates under the auspices of the ICPC Foundation and operates under agreements with host universities and non-profits, all in accordance with the ICPC Policies and Procedures. From 1977 until 2017 ICPC was held under the auspices of ACM and was referred to as ACM-ICPC. History The ICPC traces its roots to a competition held at Texas A&M University in 1970 hosted by the Alpha chapter of the Upsilon Pi Epsilon Computer Science Honor Society (UPE). This initial programming competition was titled First Annual Texas Collegiate Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Daniel Sleator
Daniel Dominic Kaplan Sleator (born 10 December 1953) is a professor of computer science at Carnegie Mellon University, Pittsburgh, United States. In 1999, he won the ACM Paris Kanellakis Award (jointly with Robert Tarjan) for the splay tree data structure. He was one of the pioneers in amortized analysis of algorithms, early examples of which were the analyses of the move-to-front heuristic, and splay trees. He invented many data structures with Robert Tarjan, such as splay trees, link/cut trees, and skew heaps. The Sleator and Tarjan paper on the move-to-front heuristic first suggested the idea of comparing an online algorithm to an optimal offline algorithm, for which the term competitive analysis was later coined in a paper of Karlin, Manasse, Rudolph, and Sleator. Sleator also developed the theory of link grammars, and the Serioso music analyzer for analyzing meter and harmony in written music. Personal life Sleator was born to William Warner Sleator, Jr., a profe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Competitive Programming
Competitive programming or sport programming is a mind sport involving participants trying to program according to provided specifications. The contests are usually held over the Internet or a local network. Competitive programming is recognized and supported by several multinational software and Internet companies, such as Google, and Meta. A programming competition generally involves the host presenting a set of logical or mathematical problems, also known as puzzles or challenges, to the contestants (who can vary in number from tens or even hundreds to several thousand). Contestants are required to write computer programs capable of solving these problems. Judging is based mostly upon number of problems solved and time spent on writing successful solutions, but may also include other factors (quality of output produced, execution time, memory usage, program size, etc.). History One of the oldest contests known is the International Collegiate Programming Contest (ICPC) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Online Judge
Competitive programming or sport programming is a mind sport involving participants trying to computer programming, program according to provided specifications. The contests are usually held over the Internet or a local network. Competitive programming is recognized and supported by several multinational software and Internet companies, such as Google, and Meta Platforms, Meta. A programming competition generally involves the host presenting a set of logical or mathematical problems, also known as puzzles or challenges, to the contestants (who can vary in number from tens or even hundreds to several thousand). Contestants are required to write computer programs capable of solving these problems. Judging is based mostly upon number of problems solved and time spent on writing successful solutions, but may also include other factors (quality of output produced, execution time, memory usage, program size, etc.). History One of the oldest contests known is the International Co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
