UVCHST-Editorials (UVCE NCode-November 2013)

Editorials-UVCHST

PROBLEM LINK:

Contest

Author: Bharathkumar Hegde

Tester: Kunal Sutradhar

Editorialist: Bharathkumar Hegde

Problem:

One stand is there in the hostel, it can hold only limited number of plates in it, find how many new stands required such that all new stands can be filled completely with the plates.(in the problem page please go through the first comment by hkbharath).

Solution:

This problem has very direct solution:
if there are N plates and one stand can hold M plates then the number of stand which can be filled completely with plates is N/M, and one stand is already there in the hostel so solution is N/M-1, if N/M = 0 then answer is 0.

//