/* C++ Program to generate all the set partitions of n numbers beginning from 1 and so on Number generates at random in range from 1 to 12 */ #include #include #include using namespace std; // A function to print the generated partition. void printArray(int p[], int n) { cout<<"\t"; for (int i = 0; i < n; i++) cout< 1. while (k >= 0 && p[k] == 1) { rem_val += p[k]; k--; } // If k < 0 then the all the element are broken down to 1. if (k < 0) return; // If value greater than 1 is found then decrease it by 1 and increase rem_val to add it to other elements. p[k]--; rem_val++; // Loop until the number of 1's are greater than the value at k index. while (rem_val > p[k]) { p[k+1] = p[k]; // Decrease the rem_val value. rem_val = rem_val - p[k]; k++; } // Assign the remaining value to the index next to k. p[k+1] = rem_val; k++; } } int main() { srand ( time(NULL) ); // инициализация функции rand значением функции time int n = rand() % 12 + 1; cout<<"Natural number for creating partitions is: "<< n << endl; cout<<"All Unique Partitions of "<

Creating unique partitions of given number