HDU 5924-Mr. Frog’s Problem

One day, you, a clever boy, feel bored in your math class, and then fall asleep without your control. In your dream, you meet Mr. Frog, an elder man. He has a problem for you.

He gives you two positive integers A and B, and your task is to find all pairs of integers (C, D), such that A≤C≤B,A≤D≤BA≤C≤B,A≤D≤B and AB+BA≤CD+DCAB+BA≤CD+DC
Input
first line contains only one integer T (T≤125T≤125), which indicates the number of test cases. Each test case contains two integers A and B (1≤A≤B≤10181≤A≤B≤1018).
Output
For each test case, first output one line “Case #x:”, where x is the case number (starting from 1).

Then in a new line, print an integer s indicating the number of pairs you find.

In each of the following s lines, print a pair of integers C and D. pairs should be sorted by C, and then by D in ascending order.
Sample Input
2
10 10
9 27
Sample Output
Case #1:
1
10 10
Case #2:
2
9 27
27 9

打表 暴力找规律 发现2个数相同 结果为1 2个数不同结果有2个 换位输出

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int N;
    scanf("%d",&N);
    int t=1;
    while (N--)
    {
        long long int n,m;
        scanf("%lld%lld",&n,&m);

//        for (int i=n; i<=m; i++)
//        {
//            for (int j=n; j<=m; j++)
//            {
//                if (1.0*(n*n+m*m)/(m*n) <= 1.0*(i*i+j*j)/(i*j) )
//                    cout<<i<<" !!!!!! !!    "<<j<<endl;
//            }
//        }
        if (n==m)
        {
            printf("Case #%d:\n",t);
            t++;
            printf("1\n");
            printf("%lld %lld\n",n,m);
        }
        else
        {
            printf("Case #%d:\n",t);
            t++;
            printf("2\n");
            printf("%lld %lld\n",n,m);
            printf("%lld %lld\n",m,n);
        }


    }
    return 0;
}