A Mathematical Curiosity
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
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 【A Mathematical Curiosity】
Recommend JGShining 答案: int main()
{
int n, m;
int r, a, b, c;
int N;
scanf("%d", &N);
while (N--)
{
c = 0;
while (scanf("%d %d", &n, &m)!=EOF)
{
if (n == 0 && m == 0)
break;
r = 0;
for (a = 1; a < n-1; ++a)
{
for (b = a+1; b <= n-1; ++b)
{
if ((a*a+b*b +m)%(a*b) == 0)
++r;
}
}
printf("Case %d: %d/n", ++c, r);
}
if (N > 0)
printf("/n");
}
return 0;
}
推荐阅读
- 杭电oj——2030汉字统计
- 845G|845G - Shortest Path Problem?(线性基)
- 输出集合中所有数据项组合
- 解题报告|51nod 1667 概率好题
- 数学思维导论(一) Introduction to Mathematical Thinking 什么是数学(为什么要学习数学?)
- 斐波那契()
- codeforces|Codeforces 845G Shortest Path Problem
- 算法|HDU 5685 (前缀+逆元)
- 【HDU 5528】Count a * b(推导)
- Problems|Leetcode 28(实现strStr()(超详细的解法!!!))