PMNT - EDITORIAL

Difficulty
Easy

Pre-requisites: Basic mathematics, Pigeon hole principle

Problem link:

Contest problem link

Practice problem link

Problem:
Given N candidates and M interviewers, each of whom can interview one candidate and takes one hour to interview each candidate, the task is to find minimum possible hours required to complete all the interviews.

Explanation:

The question is based on simple Pigeon Hole Principle.

There are N candidates and M interviewers. If you understand the Pigeon hole principle, consider candidates to to be pigeons and interviewers to be holes.
Using Pigeon hole principle the output comes out to be (M/N)+1.

Problem setter’s solution: SOLUTION

//