杭电acm--1017
2015-10-12 20:01
344 查看
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.
先输入一个数N然后会分N块输入,每块每次输入2个数,n,m,n=m=0时结束,当a和b满足0<a<b<n且使(a^2+b^2
+m)/(ab) 的值为整数时,那么这对a和b就是一组,输出这样的组数,一行输入,跟着一样输出。
要注意各种空格
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
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.
先输入一个数N然后会分N块输入,每块每次输入2个数,n,m,n=m=0时结束,当a和b满足0<a<b<n且使(a^2+b^2
+m)/(ab) 的值为整数时,那么这对a和b就是一组,输出这样的组数,一行输入,跟着一样输出。
要注意各种空格
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
#include<stdio.h> #include<stdlib.h> #include<iostream> #include<cmath> #include<iomanip> //#define P 3.141592653 using namespace std; void main() { int N, n, m; int count=0,t=0; cin >> N; //cout << endl; while (N--) { while (cin >> n >> m) { if (n == 0 && m == 0 || n>100) break; t++; 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; count = 0; } t = 0; if (N) cout << endl; } system("pause"); }
相关文章推荐
- ASP.NET Razor - 标记
- 让程序在崩溃时体面的退出之CallStack
- 单独使用collectionCell视图
- android 环绕TextView效果
- Android四大组件解析
- 利用JQUERY来操作Radio的方法
- ajax 实现文件下载 【转】
- 等价类_测试基础
- 让程序在崩溃时体面的退出之Unhandled Exception
- 只有程序员看的懂面试圣经|如何拿下编程面试
- 【Emgu】一起学EmguCV(一)配置与使用
- JavaScript开发工具WebStorm教程:用户界面简介
- HTTP、Scoket网络协议浅解
- 从12大技巧、30个案例、99个模板谈怎么写标题
- POJ 2109 Power of Cryptography 贪心
- asp jquery ajxs json和jsonp跨域请求
- cocos2dx 3.8 安装环境配置搭建
- mysql相关包括事件、事务、以及服务器上自动备份
- jquery判断checkbox是否选中及改变checkbox状态
- android 流量统计