A Mathematical Curiosity
来源:互联网 发布:php 短信验证码生成 编辑:程序博客网 时间:2024/06/08 10:02
A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31587 Accepted Submission(s): 10118
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
整除就是取余得0
http://acm.hdu.edu.cn/showproblem.php?pid=1017
#include <cstdio>int main(){ int N; scanf("%d",&N); while(N--){ int Case=1,n,m; while(scanf("%d%d",&n,&m)!=EOF&&(n+m)){ int ans=0; for(int b=1;b<n;b++) for(int a=1;a<b;a++) if((a*a+b*b+m)%(a*b)==0)ans++; printf("Case %d: %d\n",Case++,ans); } if(N) printf("\n"); } return 0;}
0 0
- A Mathematical Curiosity
- HDU1017 A Mathematical Curiosity
- A Mathematical Curiosity
- 1017 A Mathematical Curiosity
- A Mathematical Curiosity
- 1017 A Mathematical Curiosity
- hdu1017 A Mathematical Curiosity
- hdu1017-A Mathematical Curiosity
- hdu1017-A Mathematical Curiosity
- [ACM]A Mathematical Curiosity
- [catch]--A Mathematical Curiosity
- A Mathematical Curiosity
- A Mathematical Curiosity
- A Mathematical Curiosity
- HDOJ A Mathematical Curiosity
- A Mathematical Curiosity
- A Mathematical Curiosity
- hdoj1017--A Mathematical Curiosity
- leetcode:Minimum Size Subarray Sum
- hdu acm steps Biker's Trip Odometer
- 【Leetcode】Delete Node in a LinkedList
- HDU 2612 Find a way
- ZOOM:1的原理和作用
- A Mathematical Curiosity
- 【峰回路转】Excel技巧百例 01.对比两列数据,然后根据数据升降给出相关标识
- Python中的random库
- 【程序员创业】商业计划书怎么写才能与众不同?
- 九度 题目1367:二叉搜索树的后序遍历序列
- [DT大数据梦工厂]-scala-helloworl的解析
- 【LeetCode-面试算法经典-Java实现】【033-Search in Rotated Sorted Array(在旋转数组中搜索)】
- IOS dismissViewControllerAnimated VS popViewControllerAnimated
- 流程控制