/*Christy is interning at HackerRank. One day she has to distribute some chocolates to her colleagues. She is biased towards her friends and plans to give them more than the others. One of the program managers hears of this and tells her to make sure everyone gets the same number. To make things difficult, she must equalize the number of chocolates in a series of operations. For each operation, she can give 1,2 or 5 chocolates to all but one colleague. Everyone who gets chocolate in a round receives the same number of pieces. For example, assume the starting distribution is [1,1,5]. She can give 2 bars to the first two and the distribution will be [3,3,5]. On the next round, she gives the same two 2 bars each, and everyone has the same number: [5,5,5]. Given a starting distribution, calculate the minimum number of operations needed so that every colleague has the same number of chocolates. Sample Input 4 2 2 3 7 Sample Output 2 Explanation Start with [2 2 3 7] Add 1 to all but the 3rd element [3,3,3,8] Add 5 to all but the 4th element [8,8,8,8] Two operations were required. */ #include #include #include #include #include #include using namespace std; typedef long long lld; int main() { int n = 4; int a[n] = {2,2,3,7}; int min=INT_MAX; //Finding the smallest element for(int i=0;i=min) { d-=5; res++; } while(d-2>=min) { d-=2; res++; } while(d-1>=min) { d-=1; res++; } } min--; if(res

EqualDistributionOfChocolates