A Mathematical Curiosity

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.


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;
}  
 
阅读更多
个人分类: acm程序设计
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭