Good evening.

I'm glad to welcome you on this Codeforces beta round.

Authors of today problemset are Ripatti (it is me) and Lepetrandr. it4.kp, MikeMirzayanov, RAD, Nerevar and dlevshunov helped in preparing the round. Delinur translated statements into English.

Good luck for all!

UPD
Winner is Neverauskas.
Editorial.

A. You can do exactly what is written in a statement. Only one pitfall in this problem is that room leader may have number of points less than zero.

Hello everyone!

I am an author of the today problemset. It is my third contest on Codeforces and the first one for div 1.

I thanks Artem Rakhov, Maria Belova, Pavel Kuznetsov and Mike Mirzayanov for help in preparing of this round.

Happy hacking!

Winner is tourist.
Editorial.

A. In this problem you can just do what is written in the statement. Let read all words. For each of them compute its length L, its the first and the last letter. If L > 10, output word without any changes, otherwise output the first letter, next L - 2 and finally the last letter.

Hello everyone!

I am an author of today problemset. It is my second round on Codeforces. I hope you will like this round like my first one:)

Good luck!

UPD
Winner is unicef.
Editorial.

A. This problem can be easily solved with the following algorithm. First, read names ans statuses of all crew members into an array. Next, iterate over the entire array 4 times. In the first pass output names of rats. In the second pass output names of women and children. In the third pass output names of men. Finally, in the fourth pass output the name of the captain.

Hello everyone!

I am problems' author of today round. I hope you will like this contest :)

I thank Artem Rakhov, Maria Belova and Dmitry Matov for help in preparing of the round.

Good luck!

UPD.
Winner is levlam.
Tutorial.

Author thanks adamax for translation this article into English.

Introduction
After Codeforces Beta Round #11 several participants expressed a wish to read something about problems similar to problem D of that round. The author of this article, for the purpose of helping them, tried searching for such information, but to his surprise couldn't find anything on the Internet. It is not known whether the search was not thorough or there's really nothing out there, but (just in case) the author decided to write his own article on this topic.

In some sense this article may be regarded as a tutorial for the problem D from Beta Round #11.