C :

#include<stdio.h>

int main()
{
	int n,m,c=0,i,j,s;
	while(scanf("%d%d",&n,&m),n||m)
	{
		for(s=0,i=1;i<n;i++)
			for(j=i+1;j<n;j++)
				if((i*i+j*j+m)%(i*j)==0)
					s++;
		printf("Case %d: %d\n",++c,s);
	}
	return 0;
}

C++ :

#include<stdio.h>

int main()
{
	int n,m,c=0,i,j,s;
	while(scanf("%d%d",&n,&m),n||m)
	{
		for(s=0,i=1;i<n;i++)
			for(j=i+1;j<n;j++)
				if((i*i+j*j+m)%(i*j)==0)
					s++;
		printf("Case %d: %d\n",++c,s);
	}
	return 0;
}

Pascal :

var i,j,k,l,n,m:longint;
begin
readln(n,m);
while(n<>0)and(m<>0)do
begin
k:=0;
l:=l+1;
for i:=1 to n-1 do
for j:=1 to n-1 do
if trunc((i*i+j*j+m)/(i*j))=(i*i+j*j+m)/(i*j)then
if i<j then 
k:=k+1;
writeln('Case ',l,': ',k);
readln(n,m);
end;
end.

Java :

import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner input = new Scanner(System.in);
        int count = 0;
        while(input.hasNextInt()){
            int n = input.nextInt();
            int m = input.nextInt();
            if(n == 0 && m == 0)
                break;
            else{
                int a,b,count1 = 0;
                for(b = 1;b < n;b++){
                    for(a = 1;a < b;a++){
                        if((a * a + b * b + m) % (a * b) == 0)
                            count1++;
                    }
                }
                count++;
                System.out.println("Case " + count + ": " + count1);
            }
        }
    }
}