A Mathematical Curiosity

最新推荐文章于 2015-07-04 19:45:17 发布

原创最新推荐文章于 2015-07-04 19:45:17 发布 · 544 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#杭电ACM笔记

ACM/ICPC 专栏收录该内容

102 篇文章

订阅专栏

本文探讨了一种独特的数学问题，即在给定整数n和m的情况下，寻找所有满足0 < a < b < n且(a² + b² + m) / (ab)为整数的整数对(a, b)的数量。通过实例演示了如何通过穷举法解决此类问题，并提供了代码实现，涵盖了多组输入数据和输出结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A Mathematical Curiosity

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

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

Sample Output

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

使用穷举法，满足条件就count计数。

#include<stdio.h>
int main()
{
    int a,b,m,n,k=0,t,count,num;
    scanf("%d",&t);
    getchar();
    while(k<t)
    {
        num=0;
        if(k>0)
            putchar(10);
        k++;
        while(scanf("%d %d",&n,&m)!=EOF)
        {
            if(n==0 && m==0)
                break;
            num++;
            count=0;
            for(a=1;a<n-1;a++)
                for(b=a+1;b<n;b++)
                {
                    if((a*a+b*b+m)%(a*b)==0)
                        count++;
                }
                printf("Case %d: %d\n",num,count);
        }
    }
    return 0;
}