求自守数

/*自守数是指一个数的平方的尾数等于该数自身的自然数。例如:5^2 = 25    25^2 = 625    76^2 = 5776    9376^2 = 87909376。求100000以内的自守数。*/

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

int main(void)
{
	for (unsigned int i = 0; i < 100000; i++)
	{
		unsigned long long square = (unsigned long long)i * i;
		unsigned int cnt = 1;

		while (cnt <= i)cnt *= 10;
			if ((square % cnt) == i)
				printf("%d	\n", i);
	}

 

posted @ 2022-03-25 10:20  小白露  阅读(106)  评论(0)    收藏  举报