Your browser (Unknown 0) is no longer supported. Some parts of the website may not work correctly. Please update your browser.

UPCOMING CHALLENGES:

CURRENT CHALLENGES:

Neon 2014

PAST CHALLENGES

Fluorum 2014

Oxygenium 2014

Nitrogenium 2013

Carbo 2013

Boron 2013

Beryllium 2013

Lithium 2013

Helium 2013

Hydrogenium 2013

Omega 2013

Psi 2012

Chi 2012

Phi 2012

Upsilon 2012

Tau 2012

Sigma 2012

Rho 2012

Pi 2012

Omicron 2012

Xi 2012

Nu 2011

Mu 2011

Lambda 2011

Kappa 2011

Iota 2011

Theta 2011

Eta 2011

Zeta 2011

Epsilon 2011

Delta 2011

Gamma 2011

December 2010

PrefixSet edition (2010-10)

Count ints with each two consecutive 1s (in a binary representation) separated by at least K 0s.

Spoken language:

In the binary number "`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

For example, the binary number "`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

int solution(char *S, char *T, int K);

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

returns the number of K-sparse integers within the range [A..B] (both ends included). If the result exceeds 1,000,000,006, the function should return the remainder from the division of the result by 1,000,000,007.

For example, given S = "101" (A = 5), T = "1111" (B=15) and K=2, the function should return 2, because there are just two 2-sparse integers in the range [5..15], namely "`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

In the binary number "`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

For example, the binary number "`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

int solution(string &S, string &T, int K);

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

returns the number of K-sparse integers within the range [A..B] (both ends included). If the result exceeds 1,000,000,006, the function should return the remainder from the division of the result by 1,000,000,007.

For example, given S = "101" (A = 5), T = "1111" (B=15) and K=2, the function should return 2, because there are just two 2-sparse integers in the range [5..15], namely "`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

In the binary number "`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

For example, the binary number "`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

int solution(string &S, string &T, int K);

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

returns the number of K-sparse integers within the range [A..B] (both ends included). If the result exceeds 1,000,000,006, the function should return the remainder from the division of the result by 1,000,000,007.

For example, given S = "101" (A = 5), T = "1111" (B=15) and K=2, the function should return 2, because there are just two 2-sparse integers in the range [5..15], namely "`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

class Solution { public int solution(string S, string T, int K); }

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

int solution(String S, String T, int K);

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

func Solution(S string, T string, K int) int

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

class Solution { public int solution(String S, String T, int K); }

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

class Solution { public int solution(String S, String T, int K); }

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

function solution(S, T, K);

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

fun solution(S: String, T: String, K: Int): Int

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

function solution(S, T, K)

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

int solution(NSString *S, NSString *T, int K);

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

function solution(S: PChar; T: PChar; K: longint): longint;

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

function solution($S, $T, $K);

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

sub solution { my ($S, $T, $K) = @_; ... }

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

def solution(S, T, K)

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

def solution(s, t, k)

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

object Solution { def solution(s: String, t: String, k: Int): Int }

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

public func solution(_ S : inout String, _ T : inout String, _ K : Int) -> Int

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

function solution(S: string, T: string, K: number): number;

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.

`100100010000`" there are at least two 0s between any two consecutive 1s.

In the binary number "`100010000100010`" there are at least three 0s between any two consecutive 1s.

A positive integer N is called *K*-*sparse* if there are at least K 0s between any two consecutive 1s in its binary representation.

`100100010000`" is 2-sparse. Similarly, "`100010000100010`" is 3-sparse. It is also 2-sparse, because 2 < 3. It is also 1-sparse and 0-sparse.

We assume that any power of 2 (i.e. "`1`", "`10`", "`100`", "`1000`", ...) is K-sparse for any K.

Write a function:

Private Function solution(S As String, T As String, K As Integer) As Integer

that, given:

- string S containing a binary representation of some positive integer A,
- string T containing a binary representation of some positive integer B,
- a positive integer K.

`1000`" (i.e. 8) and "`1001`" (i.e. 9).

Write an ** efficient** algorithm for the following assumptions:

- K is an integer within the range [1..30];
- the length of string S is within the range [1..300,000];
- the length of string T is within the range [1..300,000];
- string S is made only of the characters '
0' and/or '1';- string T is made only of the characters '
0' and/or '1';- S and T have no leading zeros;
- A ≤ B.