### NALP's blog

By NALP, 14 years ago, translation,
Hello everybody.

I would like to invite you to participate in a new competition, that will be held on the 30th of October at 16:00 MSK. It will be a part of the series of winter programming school olympiads, but it will be only a standart Codeforces round for adult participants.

Teams aren't invited, only single members. The official rules will be ACM-ICPC.
Jury has decided to increase the duration of the competition, which will be 4 hours long.

### Attention: People, who are considered out of competition, are participants of Codeforces Round #38, others are participants of School Personal Contest #1. But we will use merged result table for updating rating.

The authors are me, Mike Mirzayanov and Artem Rakhov. Also I'm expressing gratitude to Maria Belova, Max Ivanov and Natalia Bondarenko for help.

P.S. Please, don't forget to register to the competition!

UPD: The contest has finished, thanks to all. I hope, you have got fun :)

Congratulations to tourist. It tooks him ~2 hours to solve all problems!

The next official school contest will be on November, 6, at 14.00 MSK

Total number of participants is 788, 274 of them have taken part in the school competition.
• +41

By NALP, 14 years ago, translation,

# A. Extra-terrestrial Intelligence

This task is very easy, and I hope all of you have solved it. But let's talk about it.

Let input sequence is named as a, and its length is n. Then let's save sequence x1, ..., xk is increasing order - all of positions, where axi = '1'.

We must check if this sequence x1, ..., xk is a arithmetic progression. We save variable d = x2 - x1 and check:
for all 1 ≤ i < k, is "d = xi + 1 - xi" correct.

If it's correct, output "YES", else "NO".
• +12

By NALP, 14 years ago, translation,
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!