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

AVAILABLE LESSONS:

Lesson 1

Iterations

Lesson 2

Arrays

Lesson 3

Time Complexity

Lesson 4

Counting Elements

Lesson 5

Prefix Sums

Lesson 6

Sorting

Lesson 7

Stacks and Queues

Lesson 8

Leader

Lesson 9

Maximum slice problem

Lesson 10

Prime and composite numbers

Lesson 11

Sieve of Eratosthenes

Lesson 12

Euclidean algorithm

Lesson 13

Fibonacci numbers

Lesson 14

Binary search algorithm

Lesson 15

Caterpillar method

Lesson 16

Greedy algorithms

Lesson 17

Dynamic programming

Lesson 90

Tasks from Indeed Prime 2015 challenge

Lesson 91

Tasks from Indeed Prime 2016 challenge

Lesson 92

Tasks from Indeed Prime 2016 College Coders challenge

Lesson 99

Future training

effortless

Given the numbers of players and available courts, calculate the maximum number of parallel tennis games.

Programming language:
Spoken language:

You are hosting a tennis tournament. P players, who will take part in the first round of this tournament, are already registered and you have reserved C tennis courts for the matches. Exactly two players play in each game and only one game can be played on each court at any given time. You want to host the maximum possible number of games starting at the same time (in order to finish the first round quickly).

How many games can be hosted in parallel simultaneously?

Write a function:

int solution(int P, int C);

that, given the number of players P and the number of reserved courts C, returns the maximum number of games that can be played in parallel.

For example, given P = 5 players and C = 3 available courts, the function should return 2, as two games can be played simultaneously (for instance, the first and second players can play on the first court, and the third and fourth players on the second court, and the third court will be empty because the fifth player doesn't have a partner to play with).

Given P = 10 players and C = 3 courts, the function should return 3, as at most three games can be hosted in parallel.

Assume that:

- P and C are integers within the range [1..30,000].

In your solution, focus on ** correctness**. The performance of your solution will not be the focus of the assessment.

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

You are hosting a tennis tournament. P players, who will take part in the first round of this tournament, are already registered and you have reserved C tennis courts for the matches. Exactly two players play in each game and only one game can be played on each court at any given time. You want to host the maximum possible number of games starting at the same time (in order to finish the first round quickly).

How many games can be hosted in parallel simultaneously?

Write a function:

int solution(int P, int C);

that, given the number of players P and the number of reserved courts C, returns the maximum number of games that can be played in parallel.

For example, given P = 5 players and C = 3 available courts, the function should return 2, as two games can be played simultaneously (for instance, the first and second players can play on the first court, and the third and fourth players on the second court, and the third court will be empty because the fifth player doesn't have a partner to play with).

Given P = 10 players and C = 3 courts, the function should return 3, as at most three games can be hosted in parallel.

Assume that:

- P and C are integers within the range [1..30,000].

In your solution, focus on ** correctness**. The performance of your solution will not be the focus of the assessment.

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

You are hosting a tennis tournament. P players, who will take part in the first round of this tournament, are already registered and you have reserved C tennis courts for the matches. Exactly two players play in each game and only one game can be played on each court at any given time. You want to host the maximum possible number of games starting at the same time (in order to finish the first round quickly).

How many games can be hosted in parallel simultaneously?

Write a function:

class Solution { public int solution(int P, int C); }

that, given the number of players P and the number of reserved courts C, returns the maximum number of games that can be played in parallel.

For example, given P = 5 players and C = 3 available courts, the function should return 2, as two games can be played simultaneously (for instance, the first and second players can play on the first court, and the third and fourth players on the second court, and the third court will be empty because the fifth player doesn't have a partner to play with).

Given P = 10 players and C = 3 courts, the function should return 3, as at most three games can be hosted in parallel.

Assume that:

- P and C are integers within the range [1..30,000].

In your solution, focus on ** correctness**. The performance of your solution will not be the focus of the assessment.

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

How many games can be hosted in parallel simultaneously?

Write a function:

func Solution(P int, C int) int

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

class Solution { public int solution(int P, int C); }

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

function solution(P, C);

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

function solution(P, C)

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

int solution(int P, int C);

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

function solution(P: longint; C: longint): longint;

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

function solution($P, $C);

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

sub solution { my ($P, $C)=@_; ... }

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

def solution(P, C)

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

def solution(p, c)

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

object Solution { def solution(p: Int, c: Int): Int }

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

public func solution(P : Int, _ C : Int) -> Int

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

public func solution(_ P : Int, _ C : Int) -> Int

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

public func solution(_ P : Int, _ C : Int) -> Int

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

How many games can be hosted in parallel simultaneously?

Write a function:

Private Function solution(P As Integer, C As Integer) As Integer

Assume that:

- P and C are integers within the range [1..30,000].

** correctness**. The performance of your solution will not be the focus of the assessment.

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

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