hdu_1017_A Mathematical Curiosity(模拟)

原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1017
#include <iostream>
using namespace std;
int main()
{
    int s;
    cin >> s;
    while(s--)
    {
        int n,m;
        int cnt = 1;
        while(1)
        {
            cin >> n >> m;
            int x = 0;
            if(n == 0 && m == 0)
                break;
            for(int i = 1;i <= n-2;i++)
            {
                for(int j = i+1;j <= n-1;j++)
                {
                    if((i*i + j*j + m)%(i*j) == 0)
                    {
                        x++;
                    }
                }
            }
            cout << "Case " << cnt << ": "<< x << "\n";//格式":"后面有空格
            cnt++;
        }
        if(s > 0) //最后的一组数据不需要空行
           cout << "\n";
    }
    return 0;
}

时间: 2024-11-10 03:40:10

hdu_1017_A Mathematical Curiosity(模拟)的相关文章

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): 41387    Accepted Submission(s): 13311 Problem Description Given two integers n and m, count the number of pairs of inte

HDU 1017 A Mathematical Curiosity【看懂题意+穷举法】

//2014.10.17    01:19 //题意: //先输入一个数N,然后分块输入,每块输入每次2个数,n,m,直到n,m同一时候为零时 //结束,当a和b满足题目要求时那么这对a和b就是一组 //注意: //每一块的输出中间有一个回车 A Mathematical Curiosity Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s)

A Mathematical Curiosity(坑水题)

A Mathematical Curiosity Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 31228    Accepted Submission(s): 10004 Problem Description Given two integers n and m, count the number of pairs of inte

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): 25871    Accepted Submission(s): 8174 Problem Description Given two integers n and m, count the number of pairs of integ

A Mathematical Curiosity 水

A - A Mathematical Curiosity Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status 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 +

A Mathematical Curiosity

A Mathematical Curiosity Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 27597 Accepted Submission(s): 8787 Problem Description Given two integers n and m, count the number of pairs of integers (a

HDU 1017A Mathematical Curiosity (暴力统计特殊要求个数)

传送门: http://acm.hdu.edu.cn/showproblem.php?pid=1017 A Mathematical Curiosity Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 47658    Accepted Submission(s): 15285 Problem Description Given two

HDUOJ A Mathematical Curiosity 1017

 此题不难就是输出格式麻烦 #include<stdio.h> int main(){ int T; scanf("%d",&T); while(T--) { int n,m,num=0; while(scanf("%d %d",&n,&m)&&n!=0) { int a,b,sum=0; for(a=1;a<100;++a) for(b=a+1;b<n;++b) { if((a*a+b*b+m)%

Hdu oj 1017 A Mathematical Curiosity

题目:点击打开链接 #include<stdio.h> int main() { int t; scanf("%d",&t); while(t--) { int a=0; int m,n; while(scanf("%d%d",&n,&m)) { if(m==0&&n==0) break; a++; int i,j,k,z=0; for(i=1;i<n;i++) for(j=i+1;j<n;j++)//