杭电 acm 1017 A Mathematical Curiosity
来源:互联网 发布:南京淘宝兼职模特招聘 编辑:程序博客网 时间:2024/05/21 10:05
A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29262 Accepted Submission(s): 9316
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
妈的蛋,我靠 我再是新手 也不能那么坑爹啊 ,wa N*N次 !
靠 题目开始好难理解的样子 m&&n都为零才是一个输入块;题目意思是在0到n中查找多少个a b满足那样的两个条件;注意每个输入块中间有空格;而最后一个没有
#include<iostream>int main(){using namespace std;int N,n,t=0,m,count=0;cin>>N;while(N--){while(cin>>n>>m,n+m){count=0;for(int i=1;i<n;i++){for(int j=i+1;j<n;j++){if((i*i+j*j+m)%(i*j)==0)count++;}}cout<<"Case "<<++t<<": "<<count++<<endl;}t=0;if(N)cout<<endl;}return 0;}
0 0
- 杭电ACM 1017 A Mathematical Curiosity
- 杭电 acm 1017 A Mathematical Curiosity
- 杭电acm—1017 A Mathematical Curiosity
- 杭电1017 A Mathematical Curiosity
- 杭电1017 A Mathematical Curiosity
- 杭电1017 之 A Mathematical Curiosity
- 杭电 1017 A Mathematical Curiosity
- [ACM]A Mathematical Curiosity
- 杭电OJ—— 1017 A Mathematical Curiosity
- 杭电OJ_DIY_YTW2_1001 A Mathematical Curiosity
- 杭电ACM1017 A Mathematical Curiosity
- HDU ACM 1017 A Mathematical Curiosity 水题
- 杭电ACM OJ 1017 A Mathematical Curiosity 题很简单,就是题目意思太让人费解了!
- ACM练习 A Mathematical Curiosity
- 1017 A Mathematical Curiosity
- 1017 A Mathematical Curiosity
- 1017 A Mathematical Curiosity
- 1017 A Mathematical Curiosity
- 终于把fedora20下apache的权限问题解决了
- 陈安之《终极成功秘诀》课程演讲会官方报名
- Android问题:自动导入需要的包
- C# hashTable的遍历【2种方法】与排序【3种方法】
- [Leetcode] 22. Generate Parentheses
- 杭电 acm 1017 A Mathematical Curiosity
- Android中Handler原理
- DataTable 将行表转化成交叉表
- C/C++预处理命令
- C宏参字符串化操作
- 黑马程序员--对面向对象的理解(二)--继承
- 【Github教程】史上最全github使用方法:github入门到精通
- 利用浏览器CSS渲染原理写出高性能的CSS代码
- Leetcode: Roman To Integer