hdu 1017 A Mathematical Curiosity
来源:互联网 发布:java并发编程实战笔记 编辑:程序博客网 时间:2024/06/08 18:39
**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.
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
1
10 1
20 3
30 4
0 0
Sample Output
Case 1: 2
Case 2: 4
Case 3: 5
**
题意:t组样例,每组样例输入n和m,1:以n=m=0作为每组样例的结束,每组样例之间输出空行,输出在n范围内,满足 0 < a < b < n 和 (a^2+b^2 +m)/(ab)为整数的数对总数。
#include<stdio.h>int main(){ int t,m,n,i,j,count,sum; scanf("%d",&t); for(int k= 0;k < t;k++) { sum = 0; if(k != 0) printf("\n"); while(scanf("%d%d",&n,&m),n!=0||m!=0) { count = 0; sum ++; for(i = 1; i < n; i ++) for(j = 1; j < n; j ++) { if((i*i+j*j+m)% (i*j) == 0&&i<j) count ++; } printf("Case %d: %d\n",sum,count); } } return 0;}
后记:这道题 自己没翻译到‘样例间有空行’这句话;忘记了while语句内是循环条件,而不是跳出条件;漏写a < b这一判断条件。所以自己WA了4遍,PE一遍。这只是一次c语言作业题,很多没参加竞赛的人是一遍a的,再不刷题,到时候自己连水题都写不动了。。。。
- 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
- POJ 1741 Tree 笔记
- 第一章 初试java
- photoshopcs6常用快捷键
- C++程序员学Python
- POJ2251:Dungeon Master(BFS)
- hdu 1017 A Mathematical Curiosity
- 拆数字
- 在myeclipse中搭建SSH框架环境
- vb.net 教程 5-16 图像处理之ImageAttributes 类2 颜色矩阵5
- 签名查看方法
- 进程与线程的区别与联系
- EasyAndroid 应对各种格式的Json,GsonParser
- 算法设计Week15 LeetCode Algorithms Problem #120 Triangle
- 20153724--3