hdu5924 Mr. Frog’s Problem 打表找规律 国庆咸鱼

Mr. Frog’s Problem

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 25 Accepted Submission(s): 17

Problem Description

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≤B and AB+BA≤CD+DC

Input

first line contains only one integer T ( T≤125 ), which indicates the number of test cases. Each test case contains two integers A and B ( 1≤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
  
  

Source

2016CCPC东北地区大学生程序设计竞赛 - 重现赛 

一开始在纸上写写画画了很久。。。并没有什么发现。。榜上面很多人过了这题。。。很sad。。。

然后自暴自弃地打了个1~100的表，发现怎么打都是那两个数

还真得就是那两个数。。。

打表代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
const double eps=1e-8;
int main(){
	int a,b,i,j;
	for(a=1;a<=100;a++){
		for(b=a;b<=100;b++){
			for(i=a;i<=b;i++){
				for(j=a;j<=b;j++){
					double mae,ato;
					mae=(pow(a,2)+pow(b,2))/((double)a*(double)b);
					ato=(pow(i,2)+pow(j,2))/((double)i*(double)j);
					if(abs(mae-ato)<eps){
						printf("A:%d B:%d C:%d D:%d\n",a,b,i,j);
					}
				}
			}
		}
	}
    return 0;
}

ac代码：

还是因为longlong   wa了几回。。。真心要注意细节啊，，，

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
long long a,b;
int main(){
    int t;
    scanf("%d",&t);
    int rnd=1;
    while(t--){
        scanf("%lld%lld",&a,&b);
        if(a==b){
            printf("Case #%d:\n1\n%lld %lld\n",rnd,a,b);
            rnd++;
        }else{
            if(a>b){
                swap(a,b);
            }
            printf("Case #%d:\n2\n%lld %lld\n%lld %lld\n",rnd,a,b,b,a);
            rnd++;
        }
    }
    return 0;
}