# A Mathematical Curiosity hdu1017

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

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

#include <iostream>

#include <algorithm>

using namespace std; int main() {       int N; cin>>N; while(N--) { int cnt=1; int n,m; while(cin>>n>>m) { if(!n&&!m) break; int a,b,ans=0; for(int a=1;a<n-1;a++)    for(int b=a+1;b<n;b++)        { if((a*a+b*b+m)%(a*b)==0) ans++; } printf("Case %d: %d\n",cnt++,ans); } if(N)               printf("\n");     } return 0; }

402 篇文章27 人订阅

0 条评论

## 相关文章

13940

19990

16010

22870

### 什么样的人生才是有意义的人生——没有标准的标准答案

【导读】其实我们可以跳出这个小圈圈去更加科客观地看一下这个世界。在夜晚的时候我们仰望天空，浩瀚的宇宙中整个地球只是一粒浮尘，何况地球上一个小小的人类？在漫长的历...

1.8K60

19440

32740

### SQL中GROUP BY用法示例

GROUP BY我们可以先从字面上来理解，GROUP表示分组，BY后面写字段名，就表示根据哪个字段进行分组，如果有用Excel比较多的话，GROUP BY比较类...

5.2K20

18430

31040