A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35580 Accepted Submission(s): 11353
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.
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题目大概意思:给出2个整数n,m,要求(a,b)0 <a < b < n,并且(a^2+b^2 +m)/(ab) 是一个整数,
第一行输入一个整数N,然后一个空白行,当a和b满足题目要求时那么这对a和b就是一组,求出所有满足要求的组的组数。
#include<stdio.h> int main() { int N; int n,m; scanf("%d",&N); while(N--) { int num=1; while(scanf("%d%d",&n,&m)!=EOF&&(n||m)) { int sum=0; int i,j; for(i=1;i<n;i++) { for(j=i+1;j<n;j++) { if((i*i+j*j+m)%(i*j) == 0) sum++; } } printf("Case %d: %d\n",num++,sum); } if(N) printf("\n"); } return 0; }