HDU 1017 A Mathematical Curiosity
来源:互联网 发布:php大转盘源码 编辑:程序博客网 时间:2024/06/06 21:45
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
题意:计算在0 < a < b < n的范围内,(a^2+b^2 +m)/(ab)的结果为整数的情况有多少个。 这道题不难写,但是输出格式特别坑。一般wa都是格式的原因。
#include<stdio.h> int main() { int ncase,ccase; long m,n,cnt; long i,j,k; scanf("%d",&ncase); for(i=1;i<=ncase;i++) { ccase=1; while(scanf("%ld%ld",&n,&m),n>0) { cnt=0; for(j=1;j<n;j++) for(k=j+1;k<n;k++) if((j*j+k*k+m)%(j*k)==0) cnt++; printf("Case %d: %ld\n",ccase++,cnt); } if(i<ncase) printf('\n'); } return 0; }
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
0 0
- HDU 1017 A Mathematical Curiosity
- HDU 1017 A Mathematical Curiosity
- HDU 1017A Mathematical Curiosity
- HDU 1017 A Mathematical Curiosity
- hdu 1017 A Mathematical Curiosity
- HDU 1017 A Mathematical Curiosity
- HDU--1017--A Mathematical Curiosity
- hdu 1017 A Mathematical Curiosity
- HDU:1017 A Mathematical Curiosity
- hdu 1017 A Mathematical Curiosity
- HDU 1017 A Mathematical Curiosity
- hdu 1017 A Mathematical Curiosity
- hdu-1017-A Mathematical Curiosity
- hdu 1017 A Mathematical Curiosity
- hdu 1017 A Mathematical Curiosity
- hdu 1017 A Mathematical Curiosity
- HDU 1017 A Mathematical Curiosity
- HDU 1017 A Mathematical Curiosity
- java 如何获取线程和线程组
- Linux生成桌面图标
- linux下部署jenkins
- Tab形式的菜单实现总结TabHost 和 FragmentTabHost
- Android编译jar和指定目标文件
- HDU 1017 A Mathematical Curiosity
- js判断ip地址是否正确
- git-忽略指定文件
- 【译】使用newInstance()来实例化fragment
- 百度移动统计iOS版V3.3服务评测
- 我的第一篇CSDN博客
- 每日一得--修改SQL表结构[字段类型]示例代码
- C#之Console输入输出实用的
- Mysql事件创建