#include<stdio.h>
void main()
{
long mul,number,k,ll,kk,n;
puts("============================================================");
puts("|| This program will find the automorphic numbers. ||");
puts("|| The defination of a automorphic number is: the mantissa||");
puts("|| of a natural number's square equals to itself. ||");
puts("|| e.g., 25^2=625, 76^2=5776, 9376^2=87909376. ||");
puts("============================================================");
printf("\n >> Please input the scale n you want to find : ");
scanf("%ld",&n);
printf("\n >> The automorphic numbers small than %ld are:\n\n",n);
for(number=0;number<n;number++)
{
for(mul=number,k=1;(mul/=10)>0;k*=10);
/*由number的位数确定截取数字进行乘法时的系数k*/
kk=k*10; /*kk为截取部分积时的系数*/
mul=0; /*积的最后n位*/
ll=10; /*ll为截取乘数相应位时的系数*/
while(k>0)
{
mul=(mul+(number%(k*10))*(number%ll-number%(ll/10)))%kk;
/*(部分积+截取被乘数的后N位*截取乘数的第M位),%kk再截取部分积*/
k/=10; /*k为截取被乘数时的系数*/
ll*=10;
}
if(number==mul) /*判断若为自守数则输出*/
printf("%ld ",number);
}
puts("\n\n >> Press any key to quit...");
getchar();
}