DYZIO - Dyzio

Dyzio is Jasiek's friend and he also likes riddles. Here is a riddle he came up with:

Jasiek, here is a piece of string, which has to be cut into smaller pieces. I will not tell you directly how to do it, but look at this sequence of zeros (0) and ones (1). A one at the begining means that the string has to be cut in half. If the first digit was zero, it would be the only digit in the sequence and mean you don't have to cut anything - I want the whole string. If you have to cut the string anyway then after the first 1 I wrote what to do with the left piece (according to the same rules as with the whole string) and then I wrote what to do with the right piece of string (all the time with the same rules of notation). Every time you have to cut the left piece first, only then can you cut the right one. Now start cutting and tell me, how many cuts you have to do until you have cut off the shortest piece.

Unfortunately mom hid the scissors from Jasiek, but luckily a computer was at hand and Jasiek quickly wrote a program simulating the string cutting. Can you write such a program?


Write a program which

  • reads (from standard input) description of the way the string is cut,
  • counts how many cuts have to be made in order to get the first shortest piece.
  • writes out the outcome (to standard output)


Ten test cases (given one under another, you have to process all!). Each test case consists of two lines. In the first line there is a number n (1<=n<=20000). In the second line one zero-one word (a sequence of zeros and ones without spaces between them) of length n - the description of the cutting procedure given by Dyzio.


For every testcase your program should write (to the standard output) only one line with one integer equal to the number of cuts which have to be made in order to get the shortest piece.


[and 9 test cases more]

[and 9 test cases more]

hide comments
dwij28: 2017-09-24 01:18:04

To get accepted in Python, use sys.setrecursionlimit(20000), otherwise it will end up in an NZEC. Got several NZECs due to that. Also use, try catch in an infinite loop with break on exception while reading input.

ashishranjan28: 2016-12-17 07:54:02

easy recursion :)

Anubhav Gupta: 2015-09-21 06:59:26

Done without recursion :)

(Tjandra Satria Gunawan)(曾毅昆): 2015-08-18 09:49:58

For those who confuse / didn't completely understand problem description you can go to forum (discuss) and search "DYZIO" there are clear sample case explanation by tripleM on the forum.

agaurav77: 2015-01-11 14:29:20

As tainic says, indeed, this one is a beautiful question. :)

Rishav Goyal: 2014-05-28 16:59:26

how to put this problem in tutorial -:)

John and the cows: 2013-08-15 13:44:50

length(string) div 2+1, I think ????

Sayan Paul: 2013-05-16 02:58:11

how to divide a string in half when its length is odd

aman jain: 2013-05-15 20:40:22

can someone explain how to cut and how we get 4 to test case given.

tainic: 2012-05-03 22:04:05

Nice! This goes into my list of beautiful problems.

Added by:Adam Dzedzej
Time limit:1.903s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Resource:Internet Contest Pogromcy Algorytmow (Algorithm Tamers)
Round III, 2003