mysterious binary sequence

Submit

Language is selected by the extension of the file. See the list of supported languages to know the extension of your language.

Problem

For a given number n, first convert it to binary.

Then repeat the substitution '01' -> '100' until you reach a fixpoint. How many times did you make this substution?

For example, 11 is '1011'
Then we repeat '01' -> '100':
'1011' -> '11001' -> '110100' -> '1110000' -> fixpoint
So f(11) is 3

Print f(0) through f(99).

Options

exec is denied

rejudge feature is enabled

22:15:25 before deadline (07/15 10:36:45 JST), all source codes will be revealed after the deadline

Sample input:_

*NOTHING*

Sample output:

0
0
0
0
0
1
0
0
0
2
1
3
0
1
0
0
0
3
2
5
1
3
3
6
0
2
1
3
0
1
0
0
0
4
3
7
2
5
5
10
1
4
3
7
3
6
6
11
0
3
2
5
1
3
3
6
0
2
1
3
0
1
0
0
0
5
4
9
3
7
7
14
2
6
5
11
5
10
10
19
1
5
4
9
3
7
7
14
3
6
6
11
6
11
11
20
0
4
3
7

Ranking

Ruby _

Ruby2 _

Perl _

Python _

Python3 _

JavaScript _

iogii _

C _

Java _

C# _

sed _

Nibbles _

Scala _

Language Ranking_

return to the top page