HDU 1017 A Mathematical Curiosity

A Mathematical Curiosity

Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 43299 Accepted Submission (s): 13943

Problem Descriptiongiven-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 was an integer N and then a blank line followed by N input blocks. Each input block was 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.

Inputyou'll is given a number of cases in the input. Each case was specified by a line containing the integers n and M. The end of input is indicated by a case in which n = m = 0. Assume that 0 < n <= 100.

Outputfor, print the case number as well as the number of pairs (a, b) satisfying the given property. Print the output for each case is on one line in the format as shown below.

Sample Input110 120 330 40 0

Sample outputcase 1:2case 2:4case 3:5

Sourceeast Central North America 1999, practice

Simple template questions for geometry
1#include <iostream>2#include <cstdio>3#include <cstring>4#include <cmath>5#include <algorithm>6 using namespacestd;7 #defineINF 0x7f7f7f8 intN;9 struct PointTen { One     Doublex, y; A}p[100001]; - BOOLCMP (point a,point B) - { the     if(a.x==b.x) -     { -         returna.y<b.y; -     } +     returna.x<b.x; - } + DoubleDis (point a,point B) A { at     returnsqrt ((a.x-b.x) * (a.x-b.x) + (A.Y-B.Y) * (a.y-b.y)); - } - DoubleGetmin (inti) - { -      DoubleD=999999, di=0; -       for(intj=i+1; j<n;j++) in      { -Di=dis (p[i],p[j]); to          if(D>di) d=di; +          Else  Break; -      } the      returnD; * } $ intMain ()Panax Notoginseng { -     inti,j,k; the     Doubleans,f; +      while(SCANF ("%d", &n)! =EOF) A     { the         if(!n) Break; +          for(i=0; i<n;i++) -         { $scanf"%LF%LF",&p[i].x,&p[i].y); $         } -Sort (p,p+n,cmp); -ans=INF; the          for(i=0; i<n-1; i++) -         {Wuyif=getmin (i); the             if(ans>f) ans=F; -         } Wuprintf"%.2lf\n", ans/2.0); -     } About     return 0; $}

HDU 1017 A Mathematical Curiosity