# Minimum number of operations required to make a permutation of first N natural numbers equal

Minimum number of operations required to make a permutation of first N natural numbers equalGiven an array A[] of size N, containing a permutation of first N natural numbers and an integer K, the task is to find the minimum number of operations required to make all array elements equal by selecting K (1 < K ≤ N) consecutive array elements and replacing them with the minimum of the selected elements.Examples:Input: A[] = {4, 2, 1, 5, 3}, K = 3, N = 5Output: 2Explanation: Select consecutive elements from index 1 to 3 and replace with the minimum of {4, 2, 1}. Therefore, A[] becomes {1, 1, 1, 5, 3}.Select consecutive elements from index from 3 to 5 and replace with minimum of {1, 5, 3}. Therefore, A becomes {1, 1, 1, 1, 1}.Therefore, the total number of operations required are 2.Input: A[] = {3, 6, 2, 1, 4, 5}, K = 2, N=6Output: 5Explanation: Select consecutive elements from index 4 to 5 and replace with the minimum of {1, 4} is 1. Therefore, A[] becomes {3, 6, 2, 1, 1, 5}Select consecutive elements from index 5 to 6 and replace with the minimum of {1, 5} is 1. Therefore, A[] becomes {3, 6, 2, 1, 1, 1}Select consecutive elements from index 3 to 4 and replace with the minimum of {2, 1} is 1. Therefore, A[] becomes {3, 6, 1, 1, 1, 1}Select consecutive elements from index 2 to 3 and replace with the minimum of {6, 1} is 1. Therefore, A[] becomes {3, 1, 1, 1, 1, 1}Select consecutive elements from index 1 to 2 and replace with the minimum of {3, 1} is 1. Therefore, A[] becomes {1, 1, 1, 1, 1, 1}Therefore, the total number of operations are 5.Approach: The idea is based on the following observations:The permutation does not matter. It is the same as placing the minimum at the beginning.The optimal number of operations required can be calculated by starting with the minimum index and moving forward by K.The problem can be solved by imagining that the minimum is at the beginning of the array and from there onwards, selecting K consecutive elements. Follow the steps below to solve the problem:Initialize the variables i and count as 0, for iterating and counting the minimum number of operations respectively.Loop while i is less than N – 1 because when i reaches N – 1, all elements have been made equal. In each current iteration, perform the following steps:Increment count by 1.Increment i by K-1 because the rightmost updated element would be used again for the next segment.Print the value of count as the result.Below is the implementation of the above approach:C++#include using namespace std;  int MinimumOperations(int A[],                      int N, int K){            int Count = 0;      int i = 0;      while (i < N - 1) {                                  i = i + K - 1;                  Count++;    }          return Count;}  int main(){        int A[] = { 5, 4, 3, 1, 2 };    int K = 3;    int N = sizeof(A) / sizeof(A);      cout 