## Problem: Cut the sticks

*Difficulty: Easy

Problem:

You are given N sticks, where the length of each stick is a positive integer. A cut operation is performed on the sticks such that all of them are reduced by the length of the smallest stick.

Suppose we have six sticks of the following lengths:

5 4 4 2 2 8


Then, in one cut operation we make a cut of length 2 from each of the six sticks. For the next cut operation four sticks are left (of non-zero length), whose lengths are the following:

3 2 2 6


The above step is repeated until no sticks are left.

Given the length of N sticks, print the number of sticks that are left before each subsequent cut operations.

Note: For each cut operation, you have to recalcuate the length of smallest sticks (excluding zero-length sticks).

Input Format
The first line contains a single integer N.
The next line contains integers: a0, a1,…aN-1 separated by space, where represents the length ith of the stick.

Output Format
For each operation, print the number of sticks that are cut, on separate lines.

Constraints

1 <= N <= 1000
1 <= ai <= 1000

Sample Input 0

6
5 4 4 2 2 8


Sample Output 0

6
4
2
1


Sample Input 1

8
1 2 3 4 3 3 2 1


Sample Output 1

8
6
4
1


Explanation

Sample Case 0 :

sticks-length        length-of-cut   sticks-cut
5 4 4 2 2 8             2               6
3 2 2 _ _ 6             2               4
1 _ _ _ _ 4             1               2
_ _ _ _ _ 3             3               1
_ _ _ _ _ _           DONE            DONE


Sample Case 1

sticks-length         length-of-cut   sticks-cut
1 2 3 4 3 3 2 1         1               8
_ 1 2 3 2 2 1 _         1               6
_ _ 1 2 1 1 _ _         1               4
_ _ _ 1 _ _ _ _         1               1
_ _ _ _ _ _ _ _       DONE            DONE


## Problem: Equal Stacks

*Difficulty: Easy

Problem:

You have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times.

Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of the three stacks until they’re all the same height, then print the height. The removals must be performed in such a way as to maximize the height.

Note: An empty stack is still a stack.

Input Format

The first line contains three space-separated integers, n1, n2, and n3, describing the respective number of cylinders in stacks 1, 2, and 3. The subsequent lines describe the respective heights of each cylinder in a stack from top to bottom:

• The second line contains n1  space-separated integers describing the cylinder heights in stack 1.
• The third line contains n2 space-separated integers describing the cylinder heights in stack 2.
• The fourth line contains n3 space-separated integers describing the cylinder heights in stack 3.

Constraints

0<= n1,n2,n3 <= 10^5
0 < height of any cylinder <=100

Output Format

Print a single integer denoting the maximum height at which all stacks will be of equal height.

Sample Input

5 3 4
3 2 1 1 1
4 3 2
1 1 4 1


Sample Output

5


Explanation

Initially, the stacks look like this:

Observe that the three stacks are not all the same height. To make all stacks of equal height, we remove the first cylinder from stacks 1  and 2 , and then remove the top two cylinders from stack 3 (shown below).

As a result, the stacks undergo the following change in height:

1. 8-3 = 5
2. 9 – 4 = 5
3. 7-1-1 =5

All three stacks now have height = 5 . Thus, we print 5  as our answer.

How to solve:

Well, you just need to pop the highest stack until all stacks have equal heights.

Implementation: Python 2

*Problem from Hackerrank

c
Compose new post
j
Next post/Next comment
k
Previous post/Previous comment
r