HDU 1017A Mathematical Curiosity (number of special requests for violence statistics)

Portal:

http://acm.hdu.edu.cn/showproblem.php?pid=1017

A Mathematical Curiosity

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

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

SOURCE Analysis: Direct violence can code:

#include <bits/stdc++.h>using namespaceStd;typedefLong LongLL;#defineMAX_V 105intMain () {intT; intn,m; scanf ("%d",&t);  while(t--)    {        intk=1;  while(~SCANF ("%d%d",&n,&m)) {if(n==0&&m==0)                 Break; intC=0; //Direct violence can             for(intI=1; i<n-1; i++)            {                 for(intj=i+1; j<n; J + +)                {                    if((i*i+j*j+m)% (i*j) = =0) C++; }} printf ("Case %d:%d\n", k++, c); }        if(t!=0) printf ("\ n"); }    return 0;}

HDU 1017A Mathematical Curiosity (number of special requests for violence statistics)