A Mathematical Curiosity

最新推荐文章于 2016-07-12 13:32:44 发布

老白号

最新推荐文章于 2016-07-12 13:32:44 发布

阅读量780

点赞数

分类专栏： acm程序设计文章标签： each input output float c

本文链接：https://blog.csdn.net/jxchinaren/article/details/2365438

版权

acm程序设计专栏收录该内容

26 篇文章 0 订阅

订阅专栏

Given two integers n and m, count the number of pairs of integers (a,b) such that 0 < a < b < n and (a²+b²+m)/(ab) is an integer.

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

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

my c++ code:

#include <iostream>
using namespace std;
int main(){
    int n,m;
    int k = 0;
    cin>>n>>m;
    while(n){
        k++;
        int ans=0;
        float dou,cha;
        int num;
        for (double a = 1; a < n-1; a++){
            for (double b = a+1; b < n; b++){

                dou = (a*a + b*b + m)/(a*b);
                num = (a*a+b*b+m)/(a*b);
                cha = dou - num;
                if (cha==0.0){
                    ans++;
                }
            }
        }
        cout << "Case " << k <<": " << ans << endl;
        cin>>n>>m;
    }

    return 0;
}