zoukankan      html  css  js  c++  java
  • hdu 1017 A Mathematical Curiosity 解题报告

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

    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
     
    简单数学题,不过那输出格式太恶心了,因此产生了无数的 wa 和 PE
    #include <stdio.h>
    #include
    <stdlib.h>
    #include
    <math.h>

    int main()
    {
    int n, m, N;
    while( scanf( "%d", &N) != EOF )
    {
    for( int r=0; r<N; ++r )
    {
    int t=1;
    while( scanf( "%d%d", &n, &m ) != EOF, n+m )
    {
    int cnt=0;
    for( int i=1; i<n; ++i )
    {
    for( int j=i+1; j<n; ++j )
    {
    int a=i*i+j*j+m;
    if( a/(i*j)*(i*j)==a )
    cnt
    ++;
    }
    }
    printf(
    "Case %d: %d\n", t++, cnt );
    }
    if( r<N-1 )
    puts(
    "" );
    }
    }
    return 0;
    }

      

  • 相关阅读:
    Lookup注解
    解决数据量大,分页查询慢的方案
    一个http的请求分析
    MYSQL
    什么是性能优化
    编码规范随笔
    装饰者模式
    单例模式
    J.U.C并发包(1)
    Java内存模型
  • 原文地址:https://www.cnblogs.com/jian1573/p/2127424.html
Copyright © 2011-2022 走看看