### MikeMirzayanov's blog

By MikeMirzayanov, 11 years ago, translation,
The contest is rescheduled to start on 19:45.

Thank you all for participating in Codeforces Beta Round #7. I hope you enjoyed it. You may discuss the problems and system in comments. Please express your opinion, especially if you notice any inappropriate behavior. And as always, I will read with interest the suggestions for improvement.

From today on both-divisions contests ratings will be updated separately for each division. I. e. ratings will be calculated as if two contests (one per division) have taken place on the same problemset.

Also I would like to see someone who wants to write contest tutorial. This must be done in Russian and English languages. Of course you must solve the problem on either contest, or in the practice. If you have a desire to do it - write in comments. Your post will be published on the main page and later available on special link available from the contest page.

Many thanks to the contest problemssetters: RAD and

Good luck.

Ratings has been updated. Solutions are available for view.
Announcement of Codeforces Beta Round #7

• +19

 11 years ago, # |   0 Can you please release the Test data?
•  11 years ago, # ^ |   0 yeah specially 42 test case of problem B
•  11 years ago, # ^ |   0 your problems was with erase 0 or something like that.
•  11 years ago, # ^ |   0 thanx bro.
•  11 years ago, # ^ |   0 I believe this case had "erase 0" in it, where one might forget to output "ILLEGAL_ERASE_ARGUMENT".
 11 years ago, # |   0 erase 0
 11 years ago, # |   0 Is there any way to see more than one page of Status?
 11 years ago, # |   +1 How can i see the others sources in this contest?
•  11 years ago, # ^ |   +12 After the contest, u can enter the contest problem set, and click the tab which show the number of solvers of the problem, then u can see the sources.
 11 years ago, # |   0 i think , i saw problem C in CodeChef.com and SGU ,what's different between them ?problem in SGU : http://acm.sgu.ru/problem.php?contest=0&problem=106
•  11 years ago, # ^ |   0 Why should there be any difference?This problem is quite standart application of linear Diophantine equations. :)
 11 years ago, # |   0 can i see any data?
 11 years ago, # |   0 Where could I find test Data?
 11 years ago, # |   +2 I think this website would better if it own a forum.
 11 years ago, # |   0 It would be awesome to view source code on the standing page.
•  11 years ago, # ^ |   0 Yes. The best way would be after double click to see submission history and if you can get source code from there. Now you can see submissions only from one page of status, there is no good solution of problem E at the moment :(
•  11 years ago, # ^ |   0 Sorry, I noticed that you can click people who solved the task on problems page.
•  11 years ago, # ^ |   0 But still in one page...
 11 years ago, # |   +1 sorry, I think this is not the place, nevertheless  I'm gonna ask it:is there an available file ( or a way ) to download the problems and print them?
 11 years ago, # |   0 Admins : Could you send an email to every one to remind about the contest few hours before it starts, I miss the last one.Thanks.
 11 years ago, # |   0 - If I want to see say Petr's  solution , anyway to see it ?- I entered the practice contest, but am only able to see the solutions of recently submitted people , not all the ones who submitted.
•  11 years ago, # ^ |   0 You can use a URL like this:http://codeforces.ru/contest/7/status/E?order=BY_ARRIVED_ASCIf Petr took part in the competition, he will 99% sure appear in this list ;)
•  11 years ago, # ^ |   0 - Thanks, I can see it now- I selected "arrived at" time in the page, but it sorts in descending order.  ( ascending order as in url works )
•  11 years ago, # ^ |   0 It seems that the functional Page Up/Page Down is not available yet.
 11 years ago, # |   0 I used printf("%lld %lld\n", x, y) ; and got WA on test 1, then switched it to cout and got accepted....is there anything wrong with %lld and printf ? (I have no problem in my pc.)
 » 3 years ago, # |   0 How to solve Problem E. Anyone who has solved please share ideas.
 » 21 month(s) ago, # |   0 How to solve problem D?
•  » » 20 months ago, # ^ |   0 Assume $0$-based indexing. Let $dp_i$ denote the degree of the $i$-th prefix. The length of the prefix, $len = i + 1$. Firstly, $dp_0 = 1$, since a $1$-length string is a palindrome. Now, to compute $dp_i$, firstly check to see if $i$-th prefix is a palindrome or not. If it is not a palindrome $dp_i = 0$. Otherwise if the prefix is palindrome, its degree would be = (degree of the first half + 1). So, $dp_i = dp_{\lfloor\frac{i-1}{2}\rfloor} + 1$.To check whehter the prefix of length $len$ is a palindrome, you have to check whether the substring on the first $\lfloor{\frac{len}{2}}\rfloor$ characters is the same as the reverse of the substring on the last $\lfloor{\frac{len}{2}}\rfloor$ characters. To compare substrings, you can use string hashing. One ways is to build prefix hashes on the string and its reverse to obtain hash of any substring in a O(1) time as described in this blog.The answer is simply $\sum\limits_{i = 0}^{n-1} dp_i$.Code