hdu 1017 A Mathematical Curiosity
来源:互联网 发布:itunes软件下载地址 编辑:程序博客网 时间:2024/05/14 05:16
A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21806 Accepted Submission(s): 6830
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和m,输出满足0 < a < b < n 且 (a^2+b^2 +m)%(ab)==0的(a,b)的个数.
#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>using namespace std;int main(){ int n,m,i,j,k; int T; scanf("%d",&T); while(T--) { int nn=1; while(scanf("%d%d",&n,&m)) { int sum=0; if(n==0&&m==0) break; for(i=1;i<n-1;i++) for(j=i+1;j<n;j++) { int t=i*j; if((i*i+j*j+m)%t==0) sum++; } printf("Case %d: %d\n",nn++,sum); } if(T) printf("\n"); } return 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
- RDBMS vs. NoSQL:反派为什么会得以存活并发展壮大
- 董淳光之SQLITE3 使用总结(3)
- Debian lxde 自动登录设置
- 发现unrealscript 反编译工具:UE Explorer
- 【Win7如何一步同步文件夹的视图】
- hdu 1017 A Mathematical Curiosity
- simplexml to array and array to xml
- Threads
- Effective C++ ——构造/析构/赋值运算符
- Java多线程(二)、线程的生命周期和状态控制
- 黑马程序员-Java面向对象-day06
- 直接内存访问(DMA)
- hibernate学习笔记03---关联
- 可以实时改变占空比的Pulse generator