Given two integers n and m, count the number of pairs of integers (a,b) such that 0 < a < b < n and (a^2+b^2 +m)/(ab) is an integer.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

You will be given a number of cases in the input. Each case is specified by a line containing the integers n and m. The end of input is indicated by a case in which n = m = 0. You may assume that 0 < n <= 100.

For each case, print the case number as well as the number of pairs (a,b) satisfying the given property. Print the output for each case on one line in the format as shown below.

1

10 1
20 3
30 4
0 0

Case 1: 2
Case 2: 4
Case 3: 5

East Central North America 1999, Practice

JGShining   |   We have carefully selected several similar problems for you:  1018 1005 1021 1019 1032 

代码：

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>

using namespace std;

int n,m;

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int k = 0;
        while(scanf("%d%d",&n,&m)!=EOF)
        {
            if(n == 0 && m == 0)
            {
                break;
            }
            int cnt = 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)
                    {
                        cnt++;
                    }
                }
            }
            printf("Case %d: %d\n",++k,cnt);

        }
        if(T)
        {
            printf("\n");
        }
    }

    return 0;
}