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

UPCOMING CHALLENGES:

Germanium 2018

CURRENT CHALLENGES:

Gallium 2018

PAST CHALLENGES

Zinc 2018

Cuprum 2018

Cutting Complexity

Nickel 2018

Cobaltum 2018

Ferrum 2018

Manganum 2017

Chromium 2017

Vanadium 2016

Titanium 2016

Scandium 2016

Calcium 2015

Kalium 2015

Argon 2015

Chlorum 2014

Sulphur 2014

Phosphorus 2014

Silicium 2014

Aluminium 2014

Magnesium 2014

Natrium 2014

Neon 2014

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

Beta 2010

Alpha 2010

respectable

Determine the number of disks that fit into the well.

Programming language:
Spoken language:

There is an old dry well. Its sides are made of concrete rings. Each such ring is one meter high, but the rings can have different (internal) diameters. Nevertheless, all the rings are centered on one another. The well is N meters deep; that is, there are N concrete rings inside it.

You are about to drop M concrete disks into the well. Each disk is one meter thick, and different disks can have different diameters. Once each disk is dropped, it falls down until:

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

(Note that if the internal diameter of a ring and the diameter of a disk are equal, then the disk can fall through the ring.)

The disks you are about to drop are ready and you know their diameters, as well as the diameters of all the rings in the well. The question arises: how many of the disks will fit into the well?

Write a function:

int solution(int A[], int N, int B[], int M);

that, given two arrays of integers − A, containing the internal diameters of the N rings (in top-down order), and B, containing the diameters of the M disks (in the order they are to be dropped) − returns the number of disks that will fit into the well.

For example, given the following two arrays:

the function should return 4, as all but the last of the disks will fit into the well. The figure shows the situation after dropping four disks.

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N) (not counting the storage required for input arguments).

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

There is an old dry well. Its sides are made of concrete rings. Each such ring is one meter high, but the rings can have different (internal) diameters. Nevertheless, all the rings are centered on one another. The well is N meters deep; that is, there are N concrete rings inside it.

You are about to drop M concrete disks into the well. Each disk is one meter thick, and different disks can have different diameters. Once each disk is dropped, it falls down until:

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

(Note that if the internal diameter of a ring and the diameter of a disk are equal, then the disk can fall through the ring.)

The disks you are about to drop are ready and you know their diameters, as well as the diameters of all the rings in the well. The question arises: how many of the disks will fit into the well?

Write a function:

int solution(vector<int> &A, vector<int> &B);

that, given two arrays of integers − A, containing the internal diameters of the N rings (in top-down order), and B, containing the diameters of the M disks (in the order they are to be dropped) − returns the number of disks that will fit into the well.

For example, given the following two arrays:

the function should return 4, as all but the last of the disks will fit into the well. The figure shows the situation after dropping four disks.

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N) (not counting the storage required for input arguments).

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

There is an old dry well. Its sides are made of concrete rings. Each such ring is one meter high, but the rings can have different (internal) diameters. Nevertheless, all the rings are centered on one another. The well is N meters deep; that is, there are N concrete rings inside it.

You are about to drop M concrete disks into the well. Each disk is one meter thick, and different disks can have different diameters. Once each disk is dropped, it falls down until:

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

(Note that if the internal diameter of a ring and the diameter of a disk are equal, then the disk can fall through the ring.)

The disks you are about to drop are ready and you know their diameters, as well as the diameters of all the rings in the well. The question arises: how many of the disks will fit into the well?

Write a function:

class Solution { public int solution(int[] A, int[] B); }

that, given two arrays of integers − A, containing the internal diameters of the N rings (in top-down order), and B, containing the diameters of the M disks (in the order they are to be dropped) − returns the number of disks that will fit into the well.

For example, given the following two arrays:

the function should return 4, as all but the last of the disks will fit into the well. The figure shows the situation after dropping four disks.

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N) (not counting the storage required for input arguments).

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

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

func Solution(A []int, B []int) int

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

class Solution { public int solution(int[] A, int[] B); }

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

function solution(A, B);

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

function solution(A, B)

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

Note: All arrays in this task are zero-indexed, unlike the common Lua convention. You can use `#A` to get the length of the array A.

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

int solution(NSMutableArray *A, NSMutableArray *B);

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

function solution(A: array of longint; N: longint; B: array of longint; M: longint): longint;

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

function solution($A, $B);

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

sub solution { my ($A, $B)=@_; my @A=@$A; my @B=@$B; ... }

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

def solution(A, B)

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

def solution(a, b)

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

object Solution { def solution(a: Array[Int], b: Array[Int]): Int }

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

public func solution(inout A : [Int], inout _ B : [Int]) -> Int

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

public func solution(_ A : inout [Int], _ B : inout [Int]) -> Int

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

- it hits the bottom of the well;
- it hits a ring whose internal diameter is smaller then the disk's diameter; or
- it hits a previously dropped disk.

Write a function:

Private Function solution(A As Integer(), B As Integer()) As Integer

For example, given the following two arrays:

Assume that:

- N and M are integers within the range [1..200,000];
- each element of arrays A, B is an integer within the range [1..1,000,000,000].

Complexity:

- expected worst-case time complexity is O(N);

Information about upcoming challenges, solutions and lessons directly in your inbox.

© 2009–2018 Codility Ltd., registered in England and Wales (No. 7048726). VAT ID GB981191408. Registered office: 107 Cheapside, London EC2V 6DN