ACM--枚举暴力--HDOJ 1017--A Mathematical Curiosity--水
2016-07-12 13:32
691 查看
HDOJ题目地址:传送门
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36758 Accepted Submission(s): 11746
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
Sample Output
题解:直接暴力解了,注意用取余%来代替除法判断是否 (a^2+b^2 +m)/(ab) 是整除。
A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36758 Accepted Submission(s): 11746
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
题解:直接暴力解了,注意用取余%来代替除法判断是否 (a^2+b^2 +m)/(ab) 是整除。
#include<stdio.h> #include<iostream> using namespace std; int main(){ int T,result,index=0,n,m; cin>>T; while(T--){ index=0; while(cin>>n>>m){ if(n==0&&m==0) break; else{ index++; result=0; for(int a=1;a<n;a++) for(int b=a+1;a<b&&b<n;b++){ int r1=a*a+b*b+m; int r2=a*b; if(r1%r2==0) result++; } printf("Case %d: %d\n",index,result); } } if(T!=0)printf("\n"); } return 0; }
相关文章推荐
- iOS滑动卡片动画
- 极光推送iOS SDK教程
- 极光推送iOS SDK教程
- IOS手势解锁详解
- 开发IOS SDK注意事项
- iOS中全局悬浮按钮,类似IPhone中的AssistiveTouch
- iOS 宏(define)与常量(const)的正确使用
- 正则表达式在ios中应用
- iOS实现透明度渐变和颜色渐变的view
- iOS判断第三方SDK是否含有广告位
- iOS真机测试详细步骤及图解
- IOS开发之----#import、#include和@class的区别
- iOS零碎知识点
- iOS实战演练之Mac OS X El 系统中安装cocoa pods完整教程(2016)
- iOS设备相机销毁
- 如何在ios工程中用oc调用js算法
- iOS中使用zxing实现扫一扫
- iOS屏幕适配
- IOS中复制对象的用法及深拷贝和浅拷贝详解
- iiOS 上线后去掉打印