HDU 1017 简单数学题
来源:互联网 发布:tomcat war 部署 mysql 编辑:程序博客网 时间:2024/04/20 14:39
A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26984 Accepted Submission(s): 8587
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
简单题:首先N的意思就是有N个组,其中每一组以m=n=0作为结束条件,另外每一组结束都要输出一空格作为结束条件,当N为0 时除外。
代码:
<span style="font-size:18px;">#include <iostream>#include <stdio.h>#include <stdlib.h>#include <iomanip>using namespace std;int main(){int N,n,m,num;cin>>N;while(N--){int flag=1;while(cin>>n>>m){if(n==0 && m==0)break;num=0;for(int a=1;a<n-1;++a){for(int b=a+1;b<n;++b){if((a*a+b*b+m)%(a*b)==0)num++;}}cout<<"Case "<<flag++<<": "<<num<<endl;}if(N!=0)cout<<endl;}return 0;}</span>
0 0
- HDU 1017 简单数学题
- HDU 2048 简单数学题
- HDU 5019 简单数学题
- hdu 5137(简单数学题)
- HDU 1214 圆桌会议 简单数学题
- HDU 1840 Equations【简单数学题】
- HDU 1220(简单题,数学题)
- hdu 2114 Calculate S(n) 简单数学题
- HDU 1058 简单数学题,有点思维
- 简单数学题-hdu-4485-B-Casting
- HDU 1302 The Snail(简单数学题)
- HDU 1678 Shopaholic(简单数学题 贪心)
- HDU-5310-Souvenir(C++ && 简单数学题)
- hdu 5417 Victor and Machine(简单数学题)
- HDU 1056 HangOver (简单数学题)
- 简单数学题
- 简单数学题
- hdu 3876 A pupil’s problem(简单数学题)
- Exception in thread "HouseKeeper" java.lang.NullPointerException
- static面试
- 三星S7562刷机包 基于官方4.0.4底包制作 桌面清爽简洁 优化精简
- Activiti环境搭建(非与Spring整合),以及入门实例--001
- 内存泄露
- HDU 1017 简单数学题
- android init.rc 到底在哪里?
- 堆和栈的区别
- 动规基础,最长上升子序列
- MyEclipse快速开发Hibernate过程图解教程
- ssh面试精华
- GDI 画图问题集锦
- 面试技能五
- Mob推出全球免费短信验证码解决方案