ACM--枚举暴力--HDOJ 1017--A Mathematical Curiosity--水
来源:互联网 发布:淘宝怎样改评价 编辑:程序博客网 时间:2024/06/02 00:38
HDOJ题目地址:传送门
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.
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
题解:直接暴力解了,注意用取余%来代替除法判断是否 (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;}
1 0
- ACM--枚举暴力--HDOJ 1017--A Mathematical Curiosity--水
- HDOJ 1017 A Mathematical Curiosity
- HDOJ 1017 A Mathematical Curiosity
- hdoj 1017 A Mathematical Curiosity
- hdoj 1017 A Mathematical Curiosity
- HDOJ 1017 A Mathematical Curiosity
- hdoj 1017 A Mathematical Curiosity
- HDOJ 1017 A Mathematical Curiosity
- 【HDOJ】【1017】A Mathematical Curiosity
- HDOJ 1017 A Mathematical Curiosity
- hdoj 1017-A Mathematical Curiosity
- HDOJ 1017-A Mathematical Curiosity
- HDOJ 1017 A Mathematical Curiosity
- HDOJ A Mathematical Curiosity
- [ACM]A Mathematical Curiosity
- HDU 1017 A Mathematical Curiosity 水题直接暴力
- HDU 1017 A Mathematical Curiosity (枚举水题)
- HDOJ 1017 A Mathematical Curiosity解题报告
- iOS控件之UITextView字数控制以及占位符的实现
- Java Security:Java加密框架(JCA)简要说明
- HTML5学习(一)—1
- 安装GenyMotion模拟器(Mac)
- 快速幂取模——Pupu(HDU 3003)
- ACM--枚举暴力--HDOJ 1017--A Mathematical Curiosity--水
- js捕获页面回车事件
- 博客首自戒
- 日常学习记录
- Android数据存储
- Linux修改文件时候,产生了一个.swap交换文件,如何删除
- 使用InspectiveC来查看调用堆栈
- Codeforces Round #361 (Div. 2) A. Mike and Cellphone ( 模拟 )
- java生成一年中假日表(包括周末和法定假期),用于计算一年中的工作日