zoukankan      html  css  js  c++  java
  • 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): 32307    Accepted Submission(s): 10353


    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
     
    Recommend
    JGShining   |   We have carefully selected several similar problems for you:  1032 1048 1015 1029 1022 
     
    很水的题,看懂题就好。
     
    题意: 0 < a < b < n and (a^2+b^2 +m)/(ab) ,满足这个公式余数为0的a,b有几组。输入数据为n,m。
     
    附上代码:
     1 #include <iostream>
     2 #include <stdio.h>
     3 using namespace std;
     4 
     5 int main()
     6 {
     7     int m, n, s, i, j, k, a, b, t;
     8     scanf("%d",&s);
     9     while(s--)
    10     {
    11         k=1;
    12         while(~scanf("%d%d",&n,&m))
    13         {
    14             t=0;
    15             if(n==0&&m==0)
    16                 break;
    17             for(a=1; a<n; a++)
    18                 for(b=1; b<a; b++)
    19                     if((a*a+b*b+m)%(a*b)==0)
    20                         t++;
    21             printf("Case %d: %d
    ",k,t);
    22             k++;
    23         }
    24         if(s) printf("
    ");
    25     }
    26 
    27     return 0;
    28 }
  • 相关阅读:
    记录某次应急演练
    C++之分文件编写
    C++之冒泡排序实现
    cobaitstrike之修改特征
    cobaitstrike之DNS上线
    网盘搜索【不断更新ing】
    CVE-2021-2109 Weblogic Server远程代码执行
    C++之一维&二维数组
    CDH-5.12.2安装教程
    linux安装mysql教程
  • 原文地址:https://www.cnblogs.com/pshw/p/4780253.html
Copyright © 2011-2022 走看看