By iakolzin, 7 years ago, translation, In English,

Contest discussion

Problem А. Second Order Statistics

Sorting

In this problem one should find a minimal element from all elements, that are strictly greater, then the minimal one or report that it doesn't exist. Of course, there can be a lot of different solutions, but one of the simplest - to sort the given sequence and print the first element, that's not equal to the previous. If all elements are equal, then the required element doesn't exist.

Read more »

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

By RAD, 7 years ago, translation, In English,

Welcome all to Codeforces Beta Round #22

Note that at this time registration is possible during the round. The contest will begin at 19:00 MSK.

Today I am an author of the problems. I would like to thank Mike Mirzayanov for help in contest preparations, Edvard Davtyan and Nickolay Kuznetsov for writing the verification solutions, and Julia Satushina for translating statements into English.

Good luck on the contest!

UPD: The contest is over. Thank you all for participating!
Problems
Results
Winner Kasparyanm_Mihail gains +203 to rating after the contest!

Read more »

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

By MikeMirzayanov, 7 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!

Read more »

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

By NALP, 7 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!

Read more »

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

By MikeMirzayanov, 7 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.

Read more »

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

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

Read more »

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

By ArtDitel, 7 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.

Read more »

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

By RAD, 7 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!

Read more »

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

By tourist, 7 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

Read more »

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

By brainail, 7 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. 

Read more »

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