HDOJ-1017 A Mathematical Curiosity（淼）

http://acm.hdu.edu.cn/showproblem.php?pid=1017

# include <stdio.h>



int find(int n, int m)

{

	int count = 0;

	for(int i = 1; i < n; i++)

	{

		for(int j = i + 1; j < n; j++)

		{

			if(((i * i) + (j * j) + m) % (i * j) == 0)

				count++;

		}

	}

	return count;

}



int main()

{

	int t;

	scanf("%d", &t);

	while(t--)

	{

		int n, m, count = 1;

		while(scanf("%d %d",&n, &m) && (n || m))

		{

			printf("Case %d: %d\n", count++, find(n, m));

		}

		if(t) printf("\n");

	}

	

	return 0;

}