zoukankan      html  css  js  c++  java
  • HDU1017--A Mathematical Curiosity

    A Mathematical Curiosity
    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 21048 Accepted Submission(s): 6558


    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


    Source
    East Central North America 1999, Practice


    Recommend
    JGShining

     1 #include<cstdio>
     2 #include<cstring>
     3 #include<algorithm>
     4 #include<iostream>
     5 using namespace std;
     6  
     7 int main()
     8 {
     9     int n;
    10     scanf("%d",&n);
    11     while(n--)
    12     {
    13         int x,y;
    14         int cas=1;
    15         while(scanf("%d%d",&x,&y)!=EOF)
    16         {
    17             if(x==0&&y==0)break;
    18             int i,j;
    19             int sum=0;
    20             for(i=1;i<x;i++)
    21             {
    22                 for(j=1;j<i;j++)
    23                 {
    24                     if((i*i+j*j+y)%(i*j)==0)sum++;
    25                 }
    26             }
    27             printf("Case %d: %d
    ",cas++,sum);
    28         }
    29         if(n>0)putchar(10);
    30     }
    31     return 0;
    32 }
    View Code
  • 相关阅读:
    053587
    053586
    053585
    053584
    053583
    053582
    053581
    053580
    053579
    053578
  • 原文地址:https://www.cnblogs.com/zafuacm/p/3185204.html
Copyright © 2011-2022 走看看