TJU 1154. A Mathematical Curiosity November 25, 2009

TJU 1154. A Mathematical Curiosity

[took 20 Mins to code]

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

int main()
{
  int i,j,k,a,b;
  int n,m,result,tmp,cases,count;
  cases=0;
  while(1)
  {
    scanf("%d%d",&n,&m);
    if(n==0&&m==0) break;
    count=0;
    for(a=1;a<n;a++)
    {
      for(b=1;b<n;b++)
      {
        if(((a*a+b*b+m)%(a*b))==0)
        {
         ++count;
         if(a==b) count=count-1;
        
        }
      }
    }

    printf("Case %d: %d\n",++cases,count/2);
  }

return 0;
}