The Program in C++ Program to Find Authomorphic numbers between 1 to 1000 is given below:

#include <iostream>
#include <cmath>
#include <string>

using namespace std;

bool isAutomorphic(int n) {
    int m = pow(10, int(log10(n)) + 1);
    return (n * n) % m == n;
}

int main() {
    cout << "Hello Codeuari Family, The Automorphic numbers between 1 and 1000 are : ";
    for (int i = 1; i <= 1000; i++) {
        if (isAutomorphic(i)) {
            cout << i << " ";
        }
    }
    cout << endl;
    return 0;
}

Output:

Hello Codeuari Family, The Automorphic numbers between 1 and 1000 are : 1 5 6 25 76 376 625

Pro-Tips💡

This program implements a function isAutomorphic to check if a number is an Automorphic number.

An Automorphic number is a number whose square ends in the same digits as the number itself.

The isAutomorphic function calculates the number of digits in n and the corresponding power of 10, then checks if the last d digits of n * n match n.

If they match, the function returns true, otherwise it returns false.

The main function loops through all numbers between 1 and 1000 and calls the isAutomorphic function for each number.

If the function returns true, the number is an Automorphic number and is printed.

The output is a list of all Automorphic numbers between 1 and 100