ENG  RUSTimus Online Judge
Online Judge
Online contests
About Online Judge
Frequently asked questions
Site news
Problem set
Submit solution
Judge status
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
back to board

Discussion of Problem 1769. Old Ural Legend

F1 !!! F1 !!!
Posted by Hikmat Ahmedov 10 Mar 2012 11:15
Dear colleagues,

Can anybody, please, explain me the condition of the problem with simple tests?

I didn’t understand given sample.

Monks were told to write all the integers starting from the smallest integer that was not a substring of that string.

If 11 was the initial string. Assuming integers with leading zeroes are not accepted, monks would start from 0, then 2 (since 1 is a substring of 11)

That’s why, if the initial string was 11, monks would have written 02345678910, am I wrong?

Could anybody please explain me the condition of the problems?

Re: F1 !!! F1 !!!
Posted by Valentin_Borisov 25 Mar 2012 19:43
The string carved on the stone is 10123456789 and the monks begin writing positive integers that are not a substring of 10123456789. The first string that is not a substring of 10123456789 is 11.
Re: F1 !!! F1 !!!
Posted by Hikmat Ahmedov 25 Mar 2012 23:22
Thank you !
Re: F1 !!! F1 !!!
Posted by inatial_D 2 Apr 2013 19:43
The english in the problem is strange..