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): 36362    Accepted Submission(s): 11606


    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<iostream>
    #include<stdio.h>
    using namespace std;
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t)
        {
            int n,m;
            scanf("%d%d",&n,&m);
            int cas=1;
            while(n+m)
            {
                int ans=0;
                for(int i=1;i<n;i++)
                {
                    for(int j=i+1;j<n;j++)
                    {
                        int tmp=i*i+j*j+m;
                        int tmp2=i*j;
                        if(tmp%tmp2==0) ans++;
                    }
                }
                printf("Case %d: %d
    ",cas++,ans);
                scanf("%d%d",&n,&m);
            }
            t--;
            if(t) printf("
    ");
                
        }
        return 0;
    }
    View Code
  • 相关阅读:
    在普通类中调用service
    layui util 工具时间戳转换
    最大值
    药房管理
    线段树2
    线段树1
    Dijkstra
    最大值最小化
    图的M 着色问题
    取余运算
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5538336.html
Copyright © 2011-2022 走看看