By MikeMirzayanov, 15 years ago, translation, In English
I invite you to participate:) Round will be non-rated, but there will not be limited registration at this time! Please, read the rules before the contest!

Full text and comments »

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

By NALP, 15 years ago, translation, In English
Welcome to Codeforces Beta Round #19.

Authors of today's contest are Artem Rakhov and me. Thanks to Mike Mirzayanov, Edvard Davtyan and Julia Satushina for help in the organisation.

I hope, you will have fun.

Good luck!


P.S. After start of the contest, you can download the statements:

English

Russian

UPD. The contest has finished and you can see the standings and tasks. The winner and only participant who has solved all the problems is kalinov. Congratulations!

Full text and comments »

Announcement of Codeforces Beta Round 19
  • Vote: I like it
  • +46
  • Vote: I do not like it

By MikeMirzayanov, 15 years ago, translation, In English

You may read complete rules here.

The text contains only preliminary rules of Codeforces contests — something surely will change. In particular, I hope to help the community to find the illogic in the rules. However, I have already discussed the format with programming contests dinosaurs and made unrated alpha contests — it seems rules are OK.

I think than the format 5 tasks x 2 hour is quite good. For this reason, in the near future we will not change it, but of course, experiments are possible.

1. Before the competition all participants are divided into rooms, each room contains about 20 participants. For now random strategy works, but after a while it will be somehow correlated with the rating.

Full text and comments »

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

By Nerevar, 15 years ago, translation, In English
Two features were added to the interface in order to improve the view of the contest standings.

Full text and comments »

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

By ArtDitel, 15 years ago, translation, In English

Contest discussion

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.

Full text and comments »

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

By RAD, 15 years ago, translation, In English

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!

Full text and comments »

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

By tourist, 15 years ago, translation, In English
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

Full text and comments »

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

By brainail, 15 years ago, In English
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.

UPD: Contest the ended, thank you all for participation!
UPD: 
  • English tutorial is available here. 

Full text and comments »

Announcement of Codeforces Beta Round 17
  • Vote: I like it
  • +31
  • Vote: I do not like it

By MikeMirzayanov, 15 years ago, translation, In English

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.

Full text and comments »

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

By RAD, 15 years ago, translation, In English

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!

Full text and comments »

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