hdu 1017 A Mathematical Curiosity
来源:互联网 发布:商机助理怎么传淘宝 编辑:程序博客网 时间:2024/06/12 00:58
A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26241 Accepted Submission(s): 8323
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
#include<iostream>#include<math.h>#include<stdio.h>#include<string.h>using namespace std;int main(){ int n,m; int ans; int k=1; int t; scanf("%d",&t); while(t--) { ans=0; k=1; while(scanf("%d%d",&n,&m)&& (n||m)) { ans=0; for(int a=1;a<n;a++) { for(int b=a+1;b<n;b++) { if((a*a+b*b+m)%(a*b)==0) { ans++; } } } printf("Case %d: %d\n",k++,ans); } if(t) { printf("\n"); } } return 0;}
0 0
- 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
- HDU 1017 A Mathematical Curiosity
- HDU 1017 A Mathematical Curiosity
- 国外大牛写的HOOK
- TOJ 3851. Variable Names
- NUMBER BASE CONVERSION(高精度)
- Mysql4.0.20中文乱码
- 算法竞赛入门经典 Dynamic Programming
- hdu 1017 A Mathematical Curiosity
- 1050. String Subtraction (20)
- EBS R12多组织的实现原理
- java面试宝典-传值和传引用
- Python核心编程 练习 第四章
- iPhone开发之网络编程 AsyncSocket
- Android 应用程序之道
- storyboard取得视图控制器
- hdu 2457 DNA repair ac自动机+dp