PTA 乙级 1091 N-自守数

#include<stdio.h>
#include<math.h>

int main()
{
	int M;

	scanf("%d", &M);
	for (int i = 0; i < M; i++)
	{
		int K, N, cnt = 0, num, flag = 0;
		scanf("%d", &K);
		num = K * K;
		do
		{
			cnt++;
			K /= 10;
		} while (K != 0);
		K = sqrt(num);
		for (N = 1; N < 10; N++)
		{
			int num1 = N * num, a = pow(10, cnt);
			if (num1%a == K)
			{
				flag = 1; break;
			}
		}
		if (flag == 1)
			printf("%d %d\n", N, num*N);
		else printf("No\n");
	}

	return 0;
}