2016CCPC东北地区大学生程序设计竞赛-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): 0    Accepted Submission(s): 0

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
  
  
  
  

   
   

  
  
  
  

   
   解题思路：打一下表就可以发现只有端点值满足条件
  
  
  
  

   
   

  
  
  
  

   
   打表代码：
  
  
  
  

   
   
   
   
#include<iostream>
#include<map>
#include<vector>
using namespace std;

int main()
{
    for(double i=1;i<=100;i++)
    {
        for(double j=i+1;j<=100;j++)
        {
            cout<<i/j+j/i<<" ";
            if(!((int)j%5)) cout<<endl;
        }
        cout<<endl;
    }
    return 0;
}


AC代码：
  
  
  
  

   
   
   
   
#include<iostream>
#include<map>
#include<vector>
using namespace std;

int main()
{
    int T;
    cin>>T;
    long long a,b;
    for(int cas=1;cas<=T;cas++)
    {
        cin>>a>>b;
        cout<<"Case #"<<cas<<":"<<endl;
        if(a==b)
        {
            cout<<"1"<<endl;
            cout<<a<<" "<<b<<endl;
        }
        else
        {
            cout<<"2"<<endl;
            if(a>b)
            {
                cout<<b<<" "<<a<<endl;
                cout<<a<<" "<<b<<endl;
            }
            else
            {
                cout<<a<<" "<<b<<endl;
                cout<<b<<" "<<a<<endl;
            }
        }
    }
    return 0;
}