A Mathematical Curiosity
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 21 Accepted Submission(s) : 7
Problem Description
Given two integers n and m, count the number of pairs of integers (a,b) such that 0 < a < b < n and (a2+b2 +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
East Central North America 1999, Practice
代码:
题意:给定一个样例(m,n) , 计算a,b,(a<b) 从1开始到小于n的数(aa+bb+m)%(a*b)是否等于0,若为0则count++
输出:(1)题中输入一个N后显示有空行,而我们则不需要输出那个空行(费解),否则格式错误;
(2)最后一块情况后面没有空行
#include<stdio.h>
int main(){
int t;
scanf("%d",&t);
while(t--){
int count,cnt,m,n;
cnt=0;
while(scanf("%d %d",&n,&m)){
count=0;//每个样例计算前都要置 0
if(m==0&&n==0){
break;
}
for(int i=1;i<n;i++){
for(int j=i+1;j<n;j++){
if((i*i+j*j+m)%(i*j)==0)
count++;
}
}
cnt++;
printf("Case %d: %d\n",cnt,count);
}
if(t!=0)
printf("\n");
}
return 0;
}