HDU 1017 A Mathematical Curiosity(枚举+mod)

HDU 1017 A Mathematical Curiosity(枚举+mod)

A Mathematical Curiosity

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

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

110 120 330 40 0

Sample Output

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

题解：

从0到n枚举 a，b(a

AC代码：

#include#includeusing namespace std;int main(){ int T,n,m,flag=0,result; cin>>T; while(T--){ flag=0; while(cin>>n>>m){ if(m==0&&n==0) break; else{ flag++; result=0; for(int a=1;a

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。