Two features were added to the interface in order to improve the view of the contest standings.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Problem А. Triangle
Pythagorean theorem, brute force
In this problem you should implement a function, which takes three points and checks whether they form a right-angled triangle. There are a lot of ways to do so, but the simplest one is using a Pythagorean theorem.
Tutorial of Codeforces Beta Round 18 (Div. 2 Only)
Welcome to Codeforces Beta Round #18
Authors of today's contest are Mike Mirzayanov, Edvard Davtyan and me. Thanks to Dmitry Matov for his help in statements preparation and Julia Satushina for translation of problems in English.
Good luck everyone!
- Problems
- Final standings
- Contest winner: I_am_Feeling_Lucky
Announcement of Codeforces Beta Round 18 (Div. 2 Only)
Contest discussion
Problem A. Noldbach problem
To solve this problem you were to find prime numbers in range [2..N]. The constraints were pretty small, so you could do that in any way - using the Sieve of Eratosthenes or simply looping over all possible divisors of a number.
Take every pair of neighboring prime numbers and check if their sum increased by 1 is a prime number too. Count the number of these pairs, compare it to K and output the result.
Problem B. Hierarchy
Problem A. Noldbach problem
To solve this problem you were to find prime numbers in range [2..N]. The constraints were pretty small, so you could do that in any way - using the Sieve of Eratosthenes or simply looping over all possible divisors of a number.
Take every pair of neighboring prime numbers and check if their sum increased by 1 is a prime number too. Count the number of these pairs, compare it to K and output the result.
Problem B. Hierarchy
Tutorial of Codeforces Beta Round 17
Welcome all to Codeforces Beta Round #17, which will be held 10 June (Thursday) 2010, 19:00 (UTC +4, Moscow time). This contest will represent I.
I would like to thank Mike Mirzayanov who made this contest possible, Artem Rakhov for helping to test authors solutions and Julia Satushina for nice the translation of problem statements into English. Great thank Gennady Korotkevich for preparation problem, writing authors solution and nice idea's. Hope you will like the problems.
I hope that number 17 would be interesting for you!
You can discuss the problems here in the comments after the end of the contest.
Announcement of Codeforces Beta Round 17
This post contains few words and many pictures. I decided to publish statistics on Codeforces visitors for the past two months. Why? I believe that it might be interesting. I took pictures from Google Analitycs.
Codeforces was born little more than 4 months ago. During this time, we held 16 contests (though one of them was non-rated). There are more than 4000 registered users, and every day we get about 30 more. There are 1797 coders participated in the contests, many of them participate in our contests regularly. The average number of registrations for one competition is growing, and I want to believe that soon it will conquer psychological barrier 1000 users. Also codeforces social network is popular: more than 400 posts, almost 6000 comments. The leader of the hit parade of posts is this post, has collected to date 184 comments. Bravo, SkidanovAlex! And of course I say thank you to everyone who helped make the project: those who help in the development, who make the problems, translate texts and write the alternative solutions, participate in community life, and just take part in contests. Thank you!
Below you will find a few more pictures and statistics, the total traffic of about 250KB.
Good afternoon.
Today I am the author of problems. I want to thank the creator of Codeforces Mike Mirzayanov and Edvard Davtyan for assistance in the problems preparation and Julia Satushina for great translations into English.
I wish everyone advance to the first division!
Artem Rakhov
UPD: The contest is over, thank you all for participating!
- Problems
- Final standings
- Contest winner: krijgertje
Announcement of Codeforces Beta Round 16 (Div. 2 Only)
Greetings, CodeForces users. CodeForces Beta Round #15 will be held today, 29th of May at 19:00 MSK. My name is Roman Iedmeksyi and I am lucky to introduce this problem set.
I would like to thank Dmitry Matov, Julia Satushina and Mike Mirzayanov for well-coordinated work on this match. Also I would like to mention the contribution of Yaroslav Tverdokhlib in problems testing.
Some information about me:
I am a student of Kyiv National Taras Shevchenko University. I started programming at school. As my first achievement I had taken third place in Ukrainian Olympiad in Informatics. Next year I’ve worked harder and was qualified to IOI 2009 selection. Unfortunately I had not enough experience to pass.
In this contest I wish you good luck and high results.
UPD contest extended by 15 minutes
UPD Codeforces team apologizes that during today's round the server was regularly unavailable due to different technical reasons. We will try to do our best to avoid similar situations on the upcoming contests. Our apologies for some mistakes in the statements. Because of these reasons today's competition results will not affect your rating.
Looking forward to seeing you at Codeforces Beta Round 16.
Announcement of Codeforces Beta Round 15
The first information letter
General information
From 2nd to 12th August 2010 Saratov State University runs an international student summer school in computer programming. Teams of three people and individual participants are invited to take part in it.
The school will take place in a picturesque place at one of Saratov resort centers on the Volga bank. The participants will be provided comfortable rooms for 2-4 people and meals three times a day. The resort center owns a beach and sport grounds.
The school curriculum includes lectures by Saratov state university coaches, joint trainings, problems tutorials and topical workshops. The curriculum is designed for younger university students who aspire to achieve high results at programming competitions.
The fees are 15000 RUR (~ 500 USD) for a person. Moreover, each team or an individual participant should bring a laptop with the support of WI-FI.
All interested participants and teams should register at http://acm.sgu.ru/sazanka-2010/ till 10th June 2010. Don't postpone the registration, as the number of participants we can take is limited.
You can get additional information by e-mail mirzayanovmr[symbol-at]gmail.com. As since the official language of the school is Russian, the registration requires knowledge of Russian. Also it is recommended to view this page in Russian.
Today's round is not quite usual. The participants of the first division can register on it and to participate out of competition. This round will be some alpha-testing for this functionality, but for the next div. 2 round you can expect a stable version.
I want a high-ranking
MikeMirzayanov
Announcement of Codeforces Beta Round 14 (Div. 2)
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/21/2024 19:24:42 (i2).
Desktop version, switch to mobile version.
Supported by
