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): 21866    Accepted Submission(s): 6853

    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
     
    思路:数学
     
    代码:
    #include <stdio.h>
    #include <stdlib.h>
    double n,m,i,j;
    int
    sum;
    int
    d;
    int
    main()
    {

        int
    t ;
        double
    s1;
        int
    s2;
        int
    k;
        scanf("%d",&k);
        for
    (d = 1;d <= k;d ++)
        {

              t = 1;
        while
    (scanf("%lf%lf",&n,&m),n != 0||m != 0)
        {

            printf("Case %d: ",t);
            t ++;
            sum = 0;
            for
    (i = 1;i < n;i ++)
                for
    (j = i +1;j < n;j ++)
                {

                     s1 = (i * i + j * j + m) / (j * i); //printf("%lf ",s1);                  s2 = (int)s1;
                     if
    (s2 == s1)
                     sum ++;
                    }

                  printf("%d ",sum);
       
        }

        if
    (d != k)
            printf(" ");

      }
     
    }
  • 相关阅读:
    Docker Private Registry
    Dockerfile
    docker存储卷
    392. 判断子序列
    1576. 替换所有的问号
    270. 最接近的二叉搜索树值
    292. Nim 游戏
    680. 验证回文字符串 Ⅱ
    876. 链表的中间结点
    543. 二叉树的直径
  • 原文地址:https://www.cnblogs.com/GODLIKEING/p/3286457.html
Copyright © 2011-2022 走看看