HDU-1017
来源:互联网 发布:怎样领取淘宝优惠券 编辑:程序博客网 时间:2024/05/17 20:10
A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37794 Accepted Submission(s): 12097
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.
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
#include <stdio.h>
int main()
{
int N, m, n, count = 0, i, j, k, num = 0;
scanf("%d", &N);
int x = N;
//printf("\n");
for (i = 0; i<N; i++)
{
while (scanf("%d%d", &n, &m) != EOF)
{
if (n == 0 && m == 0)
break;
//int a,b;
count = 0;
for (j = 1; j<n; j++)
{
for (k = j + 1; k<n; k++)
{
if ((j*j + k*k + m) % (j*k) == 0)
count++;
}
}
num++;
printf("Case %d: %d\n", num, count);
}
num = 0;
if (--x)
printf("\n");
}
{
int N, m, n, count = 0, i, j, k, num = 0;
scanf("%d", &N);
int x = N;
//printf("\n");
for (i = 0; i<N; i++)
{
while (scanf("%d%d", &n, &m) != EOF)
{
if (n == 0 && m == 0)
break;
//int a,b;
count = 0;
for (j = 1; j<n; j++)
{
for (k = j + 1; k<n; k++)
{
if ((j*j + k*k + m) % (j*k) == 0)
count++;
}
}
num++;
printf("Case %d: %d\n", num, count);
}
num = 0;
if (--x)
printf("\n");
}
return 0;
}
}
0 0
- hdu 1017
- HDU 1017
- HDU 1017
- HDU-1017
- hdu 1017
- hdu 1017
- hdu 1017
- hdu 1017
- HDU 1017
- HDU 1017
- hdu 1017
- HDU-1017
- HDU 1017
- hdu 1017
- hdu 1017
- HDU-1017
- hdu 1017
- hdu 1017
- HDU 1358 KMP模板
- Spring JdbcTemplate
- 【约瑟夫环—数学策略】
- Android阅读源码的几种方法
- MySQL配置
- HDU-1017
- Android类似微博弹出窗口效果并且点击事件
- 设计模式之——工厂方法设计模式
- 383.[LeetCode]Ransom Note
- java短信发送,验证功能
- 数据结构上机实验之二分查找
- C++学习-类和对象
- SQL注入语句大全
- 初识Androidannotation