zoukankan      html  css  js  c++  java
  • HDU 1017 A Mathematical Curiosity(枚举)

    题目链接

    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
     
    #include <cstdio>
    #include <iostream>
    #include <string>
    #include <cstring>
    #include <stack>
    #include <queue>
    #include <algorithm>
    #include <cmath>
    #include <map>
    using namespace std;
    //#define LOCAL
    
    int main()
    {
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
    #endif // LOCAL
        //Start
        int N;
        cin>>N;
        while(N--)
        {
            int i=0;
            int n,m;
            while(cin>>n>>m)
            {
                if(n==0&&m==0)break;
                i++;
                int ans=0;
                for(double j=1;j<n-1;j++)
                {
                    for(double k=j+1;k<n;k++)
                    {
                        double t=(k*k+j*j+m)/(j*k);
                        if((int)t==t)ans++;
                    }
                }
                printf("Case %d: %d
    ",i,ans);
            }
            if(N!=0)printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    css样式的调用方法
    分页的实现 (占个位)
    获取当前脚本的进程PID号
    Mail插件 (占个位 后面补充)
    ovs-vswitchd的启动分析
    OPCServer:使用Matrikon OPC Server Simulation
    OPCServer:使用KEPServer
    Java OPC 代码
    OPC 协议认识
    OPC 技术学习总结
  • 原文地址:https://www.cnblogs.com/gpsx/p/5160583.html
Copyright © 2011-2022 走看看