hdu-oj 1017 A Mathematical Curiosity
来源:互联网 发布:下载安装农村淘宝app 编辑:程序博客网 时间:2024/06/05 23:06
A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26183 Accepted Submission(s): 8306
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—b范围内满足(a^2+b^2 +m)%(ab)==0的个数。
附代码:
#include <stdio.h>int main(){ int n,i,j,m,k,a,b; scanf("%d",&n); while(n--) { j=0; while(scanf("%d%d",&m,&k),m+k) { i=0; for(a=1;a<m-1;a++) { for(b=a+1;b<m;b++) { if((a*a+b*b+k)%(a*b)==0) i++; } } printf("Case %d: %d\n",++j,i); } if(n) printf("\n"); } return 0;}
0 0
- hdu-oj 1017 A Mathematical Curiosity
- Hdu oj 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
- inline关键字
- LINUX下删除文件磁盘空间不释放的原因
- 淘宝IP地址库采集
- UVALive 5116 Dividing Stones(dfs + 打表)
- 51Talk-Level 7 Unit 1 L3
- hdu-oj 1017 A Mathematical Curiosity
- <MFC实践>定时器详解及其简单实例二则
- theme主题
- thinkPHP 01 介绍以及安装
- 2014新生暑假个人排位赛07 B.最长数链
- Linux基础
- 试了一下一致性哈希(consistent hashing)
- <游戏开发中的人工智能> -- 阅读笔记
- Git项目管理 第1章 Git版本控制软件安装与使用