HDU 1017 A Mathematical Curiosity (数学)
来源:互联网 发布:qq for mac os x 10.6 编辑:程序博客网 时间:2024/04/29 09:18
A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25871 Accepted Submission(s): 8174
Total Submission(s): 25871 Accepted Submission(s): 8174
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
Source
East Central North America 1999, Practice
Recommend
JGShining | We have carefully selected several similar problems for you: 1013 1018 1005 1021 1012
对这道题不解释,题目的样例错了,那个1后面根本不要空行,还是看讨论区才知道。
代码:78MS
对这道题不解释,题目的样例错了,那个1后面根本不要空行,还是看讨论区才知道。
代码:78MS
#include<iostream> using namespace std; int main(){ int n,m,cont=0,num=0; int T; cin>>T; while(T--) { while(cin>>n>>m&&n!=0) { int a,b; for(a=1;a<=n;++a){ for(b=a+1;b<n;++b){ if((a*a+b*b+m)%(a*b)==0) cont++; } } cout<<"Case "<<++num<<": "<<cont<<endl; //没打空格的同学伤不起啊。。。 cont=0; } num=0; if(T) cout<<endl; } }
0 0
- hdu 1017 A Mathematical Curiosity(数学:水题)
- HDU 1017 A Mathematical Curiosity (数学)
- 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
- 步骤来安装谷歌Analytics(分析)
- 电瓶故障导致抛锚 572路乘客自行下车
- 步骤以网络营销成功
- 微信发送接收消息类型的整理
- Spring MVC 3 深入总结
- HDU 1017 A Mathematical Curiosity (数学)
- sublime安装与配置
- cocos2dx学习笔记(截图)
- 以太网数据帧结构分析
- Drools规则引擎初学入门实例HelloWorld
- org.apache.ibatis.exceptions.PersistenceException: 问题
- 第一天
- 来源收入为免费分类
- WebView