Dado un número N, la tarea es verificar si el número es un número automórfico o no. Un número se llama número automórfico si y solo si su cuadrado termina en los mismos dígitos que el número mismo.
Ejemplos:
Input : N = 76 Output : Automorphic Explanation: As 76*76 = 5776 Input : N = 25 Output : Automorphic As 25*25 = 625 Input : N = 7 Output : Not Automorphic As 7*7 = 49
C++
// C++ program to check if a number is Automorphic #include <iostream> using namespace std; // Function to check Automorphic number bool isAutomorphic(int N) { // Store the square int sq = N * N; // Start Comparing digits while (N > 0) { // Return false, if any digit of N doesn't // match with its square's digits from last if (N % 10 != sq % 10) return false; // Reduce N and square N /= 10; sq /= 10; } return true; } // Driver code int main() { int N = 5; isAutomorphic(N) ? cout << "Automorphic" : cout << "Not Automorphic"; return 0; }
Java
// Java program to check if a number is Automorphic class Test { // Function to check Automorphic number static boolean isAutomorphic(int N) { // Store the square int sq = N * N; // Start Comparing digits while (N > 0) { // Return false, if any digit of N doesn't // match with its square's digits from last if (N % 10 != sq % 10) return false; // Reduce N and square N /= 10; sq /= 10; } return true; } // Driver method public static void main(String[] args) { int N = 5; System.out.println(isAutomorphic(N) ? "Automorphic" : "Not Automorphic"); } }
Python3
# Python program to check if a number is Automorphic # Function to check Automorphic number def isAutomorphic(N) : # Store the square sq = N * N # Start Comparing digits while (N > 0) : # Return false, if any digit of N doesn't # match with its square's digits from last if (N % 10 != sq % 10) : return False # Reduce N and square N //= 10 sq //= 10 return True # Driver code N = 5 if isAutomorphic(N) : print ("Automorphic") else : print ("Not Automorphic") # This Code is contributed by Nikita Tiwari.
C#
// C# program to check if a // number is Automorphic using System; class GFG { // Function to check Automorphic number static bool isAutomorphic(int N) { // Store the square int sq = N * N; // Start Comparing digits while (N > 0) { // Return false, if any digit // of N doesn't match with its // square's digits from last if (N % 10 != sq % 10) return false; // Reduce N and square N /= 10; sq /= 10; } return true; } // Driver Code public static void Main() { int N = 5; Console.Write(isAutomorphic(N) ? "Automorphic" : "Not Automorphic"); } } // This code is Contributed by Nitin Mittal.
PHP
<?php // PHP program to check if // a number is Automorphic // Function to check // Automorphic number function isAutomorphic($N) { // Store the square $sq = $N * $N; // Start Comparing digits while ($N > 0) { // Return false, if any // digit of N doesn't // match with its square's // digits from last if ($N % 10 != $sq % 10) return -1; // Reduce N and square $N /= 10; $sq /= 10; } return 1; } // Driver code $N = 5; $geeks = isAutomorphic($N) ? "Automorphic" : "Not Automorphic"; echo $geeks; // This code is contributed by ajit ?>
Javascript
<script> // Javascript program to check if // a number is Automorphic // Function to check // Automorphic number function isAutomorphic(N) { // Store the square let sq = N * N; // Start Comparing digits while (N > 0) { // Return false, if any // digit of N doesn't // match with its square's // digits from last if (N % 10 != sq % 10) return -1; // Reduce N and square N /= 10; sq /= 10; } return 1; } // Driver code let N = 5; let geeks = isAutomorphic(N) ? "Automorphic" : "Not Automorphic"; document.write(geeks); // This code is contributed by _saurabh_jaiswal </script>
Publicación traducida automáticamente
Artículo escrito por GeeksforGeeks-1 y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA