joj1145

Authors

Contests
 
Problems
 
Status
 
Links

[새 버전judge는 special judge를 지원합니다. 제출한 상태 페이지가 추가되었습니다. 제출 코드에 대한 언어 검사가 추가되었습니다] [새 버전judge 시스템이 최근에 시험적으로 실행되었습니다. 메모리 경계를 넘어 Waiting 문제를 해결할 수 있기를 바랍니다]
[more]
Welcome,  �γɺ�
[JPoints:  965, Sender!:  0/10]

 1145: A Mathematical Curiosity

Result
TIME Limit
MEMORY Limit
Run Times
AC Times
JUDGE
3s
8192K
1783
548
Standard
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.

Input

You will be given a number of cases in the input. Each case is specified by a line containing the integers n and m. The end of input is indicated by a case in which n = m = 0. You may assume that 0 < n <= 100.

Output

For each case, print the case number as well as the number of pairs (a,b) satisfying the given property. Print the output for each case on one line in the format as shown below.

Sample Input

1

10 1
20 3
30 4
0 0

Sample Output

Case 1: 2
Case 2: 4
Case 3: 5

This problem is used for contest: 110 
Submit / Problem List / Status / Discuss
Problem Set with Online Judge System Version 3.12 Jilin University
Developed by skywind, SIYEE
#include int find(int n,int m) { int num=0; for(int a=1;a using namespace std; int main() { cout<<(1&1)<