这是一道比较简单的题,因为n给的比较小,所以直接用for循环来判断就好了。
但是要注意输入输出格式,因为一不小心就会造成PE。
题目如下:
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.
输入样例:
1
10 1
20 3
30 4
输出样例:
Case 1: 2
Case 2: 4
Case 3:5
题目的大致意思是:
给定两个整数n和m,计算形如(a,b)的整数对数,使(a^2+b^2+m)/(ab)算出来的结果也是一个整数。别忘了,a,b要符合0<a<b<