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

Happy New Year, Happy New Code!

Let the new year bring you not only the traditional happiness, luck and health, but little programmer's delight: complete solutions, advance of (semi)finals, rating increase and absolutely no need to debug because of the perfect code. Wish you beautiful ideas and implementations!

It is usual to make presents On New Year. I do not know, what can you prepare for Codeforces (problems? articles?), and we decided that on New Year's sometimes happens what does not happen on other days. In the New Year holidays (from 31 December to 3rd January) in the user interface (Profile -> Settings -> handle) you can change your handle to any other.


Have fun celebrating the holiday,
Codeforces team

P.S. Thanks to anatoly-rr for such a beautiful calendar.

Read more »

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

By MikeMirzayanov, 7 years ago, translation, In English,
Hello!

I invite you to participate in Codeforces Beta Round #48. This time I acted as the author of the contest. I believe it is really exciting too! I urge you to follow my example. Codeforces is happy to contest authors.
With contest proposals please contact RAD (our problem coordinator).Participants are waiting for your problems!

UPD:
PDF statements will be also available after the contest start. Please, use the link.

I wish you beautiful solutions,
MikeMirzayanov

Read more »

Announcement of Codeforces Beta Round #48
 
 
 
 
  • Vote: I like it  
  • +64
  • Vote: I do not like it  

By MikeMirzayanov, 7 years ago, translation, In English,
Good night everybody. I'm writing this at night, which is why my greeting is such. I would like to present to you several improvements on Codeforces.

1. Now when you click at the cell of the standings and view the history, you can find a link to its source code. Thus, you have a direct opportunity to view the code of each user for each problem. Of course, the judgement protocol with tests is also available there. At the moment viewing different solutions of one problem by one person is not very convenient - we'll think of something later.

Read more »

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

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

Problem A: Answer is floor(N*M*0.5). Since there is N*M cells on the board and each domino covers exactly two of them we cannot place more for sure. Now let's show how to place exactly this number of dominoes. If N is even, then place M rows of N/2 dominoes and cover the whole board. Else N is odd, so cover N-1 row of the board as shown above and put floor(M/2) dominoes to the last row. In the worst case (N and M are odd) one cell remains uncovered.

Read more »

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

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

Hi everybody,

I am happy to tell you that Codeforces will soon free you from reading those endless "Please, give me test #??" in the comments. Now you can click on a link with the submission-id on the status page and it will show not only the original solution texts, but also the tests on which testing was performed (the judging system report). It will not contain the full inputs/outputs/answers if they are too large – you will have to wait for now and enjoy their prefixes. As soon as we understand that there're no bugs in the implementation, we will open all the previous contests to view the tests.

However, that is only the first step; later you will be able to download contest problem archives that will contain full texts (or their generators) as well as the authors' solutions and other materials.

Of course we do not want Codeforces problems to be copied from one "online judge" to another one. You’ve got to understand that Codeforces puts huge effort into preparing tasks and organizing contests. That's why we limit the material usage to make using our problems on websites or in other automatic testing systems impossible. On the other hand, we will be glad if the contest materials will be useful for individual training or for some assemblies, training sessions etc. with the onsite participants. Read the license text carefully as we want some Codeforces data to be published near (or inside) the problem tasks.

At the moment it is version 0.1 of the license, we will perhaps change a lot in it, but I guess the idea will undergo no changes.

Codeforces materials usage license (v. 0.1)

  1. You may publish the texts of Codeforces problems in any open sources, but you must preserve a direct link to the site http://codeforces.ru (http://codeforces.com for English statements) and indicate Codeforces as the problem source. These data should be located in the close proximity to the statement, be easily noticeable and readable. It is forbidden to publish Codeforces problems in open sources supporting automatic testing (such as online judges or similar resources).
  2. You must not use tests and other materials of the problems (generators, checkers, validators) to publish tasks in open sources supporting automatic testing (such as online judges or similar resources) even provided the original problem conditions has been changed.
  3. You may use the provided material: tests, generators, checkers, validators and others for individual training or to organize short-term teaching and training activities with the participants present on-site. Task conditions should contain the data from paragraph 1 of this license. The secondary (subsequent) distribution of the tasks should contain this license and comply fully with the license’s rules.

Read more »

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

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

Good afternoon.

One more codeforces format round takes place this evening. I'm the author of the contest problems. Artem Rakhov and Maria Belova helped me to prepare the problems. Great thanks to them and all codeforces "fighters"!

I wish you good luck and funny hacks!

P.S:  This round won't be rated. So your ratings won't change. That's because of severe problems with codeforces server. Read here for explanation.


Read more »

Announcement of Codeforces Beta Round #47
 
 
 
 
  • Vote: I like it  
  • +49
  • Vote: I do not like it  

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

Good evening!

Soon many of you will have your examinations, and someone even have it now. I wish you excellent marks and many easy exams!

Thanks to Nickolay Kuznetsov, Gerald Agapov and Ivan Fefer for their help in preparation of the round.

Good luck!

Artem Rakhov and Codeforces team


UPD:

Ratings will be updated later

Read more »

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

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

Let me say the customary phrase "The series of school online Olympiads have ended!"

The organization of all the Olympiads was supported by Yandex and ABBYY companies. Overall 6 competitions took place, three team Olympiads and three individual ones. It is now high time we looked at the results and found the Olympiad winners. The two nominations (team contests and individual contests) were ratified individually – in each of them the results of the participants’ best two of three performances. Here are the links to the total results in each nomination:

Overall about 750 participants from all over the world had been registered during the series. Of course, the majority of them were Russian participants. As we can see, about 180 teams took part in the team contests and more than 400 school students took part in the individual contests.

After discussion with the WCS organizers the results were decided to be calculated in the following manner. In the team contests 34 best teams (that scored more than 175 points) are rewarded. Among them
  • 8 best teams receive first degree certificates:
    1. Gennady Korotkevich team (Gomel, Belarus)
    2. PhTL №1 #1 (Saratov, Russia)
    3. despise_oimaster team (China)
    4. Minsk-1 team (Minsk, Belarus)
    5. LIT: LIT_1 team (Alexandria, Ukraine)
    6. Fisher is a ball! team (Perm, Russia)
    7. Gomel-2 team (Gomel, Belarus)
    8. Mozyr-1 team (Mozyr, Belarus)
  • The teams that win places form 9th to 19th receive second degree certificates.
  • And the teams that win places from 19th to 33rd receive third degree certificates (note that the 33rd place is divided between two teams).

Read more »

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

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

Good day!

I invite everyone to take part in the last contest of the series of WCS olympiads for school students which is one of the regular Codeforces rounds at the same time. The start of the contest is  on the 12th of December, at 11:00 MSK.

The competition rules are ACM-ICPC rules, the duration of the contest is 3 hours.

Like the previous school individual olympiads, the contest will be rated for all participants (both for school students and others). Rating will be calculated according to the merged result table.

The authors of the problems are me and Dmitry Matov again. Thanks to Gerald Agapov and Artem Rakhov for their help in preparing the problems and to Maria Belova for translating the problem statements.

Good luck everyone!

UPD. The contest is over. The results are available. The winner of School Personal Contest is scottai1, the winner of Codeforces Beta Round is ilyakor. Congratulations to the winners!

The author's problem analysis is posted. Now problems G and H are added to the tutorial, too.

Thanks to everyone who participated in WCS series for school students, officially and unofficially!




Read more »

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

By MikeMirzayanov, 7 years ago, translation, In English,
Hello!

Despite the fact that Artem Rakhov prepared the round - I'm writing this post, as he is currently training for the ACM-ICPC World Finals, writing a contest with the teammates.

Contest has been prepared by: Artem Rakhov, Gerald Agapov (congratulations on the "redness") and Maria Belova.

Wish you high rating,
MikeMirzayanov

Read more »

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