C++ Program to Check if all array elements can be converted to pronic numbers by rotating digits

// C++ program for the above approach
#include <bits/stdc++.h>
using namespace std;

// function to check Pronic Number
bool isPronic(int x)
{
    for (int i = 0; i < (int)(sqrt(x)) + 1; i++) 
    {

        // Checking Pronic Number
        // by multiplying consecutive
        // numbers
        if (x == i * (i + 1)) 
        {
            return true;
        }
    }
    return false;
}

// Function to check if any permutation
// of val is a pronic number or not
bool checkRot(int val)
{

    string temp = to_string(val);
    for (int i = 0; i < temp.length(); i++) 
    {
        if (isPronic(stoi(temp)) == true)
        {
            return true;
        }
        temp = temp.substr(1, temp.size() - 1) + temp[0];
    }
    return false;
}

// Function to check if all array
// elements can be converted to
// a pronic number or not
bool check(int arr[], int N)
{

    // Traverse the array
    for (int i = 0; i < N; i++) 
    {

        // If current element
        // cannot be converted
        // to a pronic number
        if (checkRot(arr[i]) == false) 
        {
            return false;
        }
    }
    return true;
}

// Driven Program
int main()
{
  
    // Given array
    int arr[] = { 321, 402, 246, 299 };
    int N = sizeof(arr) / sizeof(arr[0]);

    // function call
    cout << (check(arr, N) ? "True" : "False");

    return 0;
}

// This code is contributed by Kingash.