方法:水题,两层循环,输出坑爹。一个大N,代表有几个输入块和几个输出块,每个块以 0 0 结束。
AC代码:
#include <iostream>
#include <iomanip>
#include <string>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <ctime>
using namespace std;
int main()
{
#ifdef Local
freopen("a.in", "r", stdin);
#endif
int n = 0, m = 0, N = 0, flag = 0;
cin >> N;
while (N--)
{
if (flag)
cout << endl;
else
flag = 1;
int t = 0;
while(cin >> n >> m && m+n)
{
int count = 0;
double i = 0, j = 0;
for (i = 1; i < n; i++)
{
for (j = i+1; j < n; j++)
{
double temp1 = (i*i + j*j + m) / (i*j);
int temp2 = (i*i + j*j + m) / (i*j);
if (temp1 == temp2)
count++;
}
}
cout << "Case " << ++t << ": " << count << endl;
}
}
return 0;
}