Problème
A number is automorphic if its square ends in the same digits as the number. For example, 76² = 5776, which ends in 76, so 76 is automorphic.
Implement automorphic_number(n).
n² can be as large as 10^18, which still fits in a signed 64-bit integer. You can compare digits from the right, or compare n² modulo 10^d with n, where d is the number of digits of n.
Input
n: The number to test.
Output
Return true if the last digits of n² are exactly the digits of n, otherwise false. 0 and 1 are automorphic (0² = 0, 1² = 1).
Contraintes
0 ≤ n ≤ 10^9
Exemples
Entrée :
n = 25
Sortie attendue :
expected = True
Entrée :
long long n = 25;
Sortie attendue :
bool expected = true;
Entrée :
long n = 25;
Sortie attendue :
bool expected = true;
Explication
25² = 625, which ends in 25, so the answer is true.
Entrée :
n = 7
Sortie attendue :
expected = False
Entrée :
long long n = 7;
Sortie attendue :
bool expected = false;
Entrée :
long n = 7;
Sortie attendue :
bool expected = false;
Explication
7² = 49, which ends in 9, not 7, so the answer is false.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Find how many digits n has.
Indice 2
The last d digits of a number are its remainder modulo 10^d.
Indice 3
Make sure n = 0 counts as one digit, so 10^d is 10, not 1.
Complexité attendue
O(d) time for d digits, O(1) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.