题意:
分N块输入。。。。。这题意好坑
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <map>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#define go(i,a,b) for(int i=a;i<=b;i++)
#define og(i,a,b) for(int i=a;i>=b;i--)
#define mem(a) memset(a,0,sizeof(a))
#define cs cout<<"-----"<<endl;
using namespace std;
const int inf=0x3f3f3f3f;
const int maxn = 1e6 + 5;
const double pi = atan(1.)*4;
typedef long long ll;
int main()
{
int N,n,m,f = 0;
cin>>N;
while(N--)
{
if(f++)
cout<<endl;
int ri = 1;
while(cin>>n>>m)
{
int cnt = 0;
if(n == 0 && m == 0)
break;
for(int i = 0;i < n;i++)
{
for(int j = i+1;j < n;j++)
{
int x = i*j;
//printf("x=%d\n",x);
if(x!=0 && (j*j + i*i + m)%x == 0)
cnt ++;
}
}
printf("Case %d: %d\n",ri,cnt);
ri++;
}
}
return 0;
}