HDU 1017 A Mathematical Curiosity
2015-07-14 09:08
435 查看
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
1 10 1 20 3 30 4 0 0
[align=left]Sample Output[/align]
Case 1: 2 Case 2: 4 Case 3: 5 就问你满足那条公式的数有多少 枚举一下就行#include <stdio.h> int main() { int kk; scanf("%d",&kk); //printf("\n"); while(kk--) { int n,m,i; for(i=1;;++i) { scanf("%d%d",&n,&m); if(n+m==0) {break;} int count=0; printf("Case %d: ",i); for(int j=1;j<n;++j) { for(int z=j+1;z<n;++z) { if((j*j+z*z+m)%(j*z)==0) count++; } } printf("%d\n",count); } if(kk>0) printf("\n"); } return 33; }
相关文章推荐
- 常用iOS第三方库以及XCode插件介绍
- 制作毛玻璃效果 分类: ios技术 2015-07-14 09:03 240人阅读 评论(0) 收藏
- 个人常用iOS第三方库以及XCode插件介绍
- iOS中懒加载
- iOS应用程序按Home键退出后,怎么设置打开程序时重新开始
- IOS GCD的使用详解
- NiosII_SPI协议(使用笔记)
- Cisco NX-OS与Cisco IOS对比
- IOS block用法
- 9秒的课程只为培养靠谱的IOS和HTML5开发人才而定制
- 学游戏开发,就是这么牛!
- iOS自定义多参数类型方法
- ios系列——文件路劲NSFileManager
- IOS开发-09.图片拉伸不变形
- iOS 笔记一: 对象创建、动态绑定、内审
- ios 集成百度sdk
- iOS 蓝牙开发那些事
- iOS中形参个数可变的方法
- IOS 根据输入值改变button颜色
- IOS 分节表视图