# A Mathematical Curiosity

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 41995    Accepted Submission(s): 13502

Problem Description

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```

Source

``` 1 #include <bits/stdc++.h>
2 using namespace std;
3 int n,m;
4 int main()
5 {
6     int t;
7     scanf("%d",&t);
8     while(t--)
9     {
10         int k=1;
11         while(scanf("%d%d",&n,&m)&&n||m)
12         {
13             int ans=0;
14             for(int i=1;i<n;i++)
15             {
16                 for(int j=i+1;j<n;j++)
17                 {
18                     if((i*i+j*j+m)%(i*j)==0)
19                         ans++;
20                 }
21             }
22            printf("Case %d: %d\n",k++,ans);
23          }
24          if(t)
25             printf("\n");
26     }
27     return 0;
28 }```

0 条评论

## 相关文章

### HDUOJ----1165Eddy's research II

Eddy's research II Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536...

29850

### HDUOJ-----Computer Transformation

Computer Transformation Time Limit: 2000/1000 MS (Java/Others)    Memory Limi...

389110

### hdu----（2586）How far away ？（DFS/LCA/RMQ）

How far away ？ Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/327...

28980

### HDU 1074 Doing Homework(状压DP)

Doing Homework Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32...

31370

### HDU 1866 A + B forever!

A + B forever! Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/3...

28050

### POJ 1163 The Triangle【dp+杨辉三角加强版(递归)】

The Triangle Time Limit: 1000MS Memory Limit: 10000K Total Submissions: ...

28770

### HDUOJ-----Difference Between Primes

Difference Between Primes Time Limit: 2000/1000 MS (Java/Others)    Memory Limit...

32760

### poj----Maximum sum(poj 2479)

Maximum sum Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3...

29660

### HDUOJ-----(1162)Eddy's picture（最小生成树）

Eddy's picture Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/327...

35290

### HDUOJ------------1051Wooden Sticks

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3276...

315100