关闭

(HDU 5924)Mr. Frog’s Problem 思维水题 <2016CCPC东北地区大学生程序设计竞赛 - 重现赛 >

377人阅读 评论(0) 收藏 举报
分类:

题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=5924

Mr. Frog’s Problem
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 A/B+B/A≤C/D+D/C

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东北地区大学生程序设计竞赛 - 重现赛

分析:
水题。由于A,B是区间的两个端点,所以A/B + B/A 已经就是最大值了。所以当A==B 时答案就是A,B;当不相等时,答案为A,B和B,A

AC代码:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;

int main()
{
    int t,kase=1;
    char a[30],b[30];
    scanf("%d",&t);
    while(t--)
    {
        cin>>a>>b;
        if(strcmp(a,b)==0)
        {
            printf("Case #%d:\n1\n",kase++);
            cout<<a<<" "<<b<<endl;
        }
        else
        {
            printf("Case #%d:\n2\n",kase++);
            cout<<a<<" "<<b<<endl;
            cout<<b<<" "<<a<<endl;
        }
    }
    return 0;
}
1
0
查看评论

hdu5924Mr. Frog’s Problem+打表

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....
  • xtulollipop
  • xtulollipop
  • 2016-10-11 22:43
  • 342

[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 ...
  • chudongfang2015
  • chudongfang2015
  • 2016-10-06 17:16
  • 329

HDU 5924 Mr. Frog’s Problem(想看证明的来)——2016CCPC东北地区大学生程序设计竞赛 - 重现赛

HDU 5924 Mr. Frog’s Problem(想看证明的来)——2016CCPC东北地区大学生程序设计竞赛 - 重现赛
  • queuelovestack
  • queuelovestack
  • 2016-10-11 21:36
  • 711

【HDU5924 2016CCPC东北地区大学生程序设计竞赛 - 重现赛 C】【水题】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): 143&...
  • snowy_smile
  • snowy_smile
  • 2016-10-08 16:35
  • 710

HDU Mr. Frog’s Problem 2016CCPC东北地区大学生程序设计竞赛 - 重现赛

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...
  • LuRiCheng
  • LuRiCheng
  • 2016-10-06 17:12
  • 445

(HDU 5926)Mr. Frog’s Game 水题 <2016CCPC东北地区大学生程序设计竞赛 - 重现赛 >

Mr. Frog’s Game One day, Mr. Frog is playing Link Game (Lian Lian Kan in Chinese). In this game, if you can draw at most three horizontal or vertica...
  • STILLxjy
  • STILLxjy
  • 2017-01-03 19:40
  • 396

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...
  • algzjh
  • algzjh
  • 2016-10-06 15:05
  • 667

HDU-2017中国大学生程序设计竞赛-网络选拔赛-部分题解及代码

ACM模版这次划水划的还好,约莫是可以进现场赛的,只是风浪太大了……好多题都读不懂。1001-Vertex Cover>>>构造<<< 构造一个二分图,思路很巧妙。1003-Friend-Graph>>>暴力枚举<<< 这个应该...
  • f_zyj
  • f_zyj
  • 2017-08-20 18:20
  • 907

HDU 5924 Mr. Frog’s Problem 【模拟】 (2016CCPC东北地区大学生程序设计竞赛)

Mr. Frog’s Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 312&...
  • u010568270
  • u010568270
  • 2016-10-20 20:14
  • 306

HDU6252-Subway Chasing

Subway Chasing                                       &...
  • a664607530
  • a664607530
  • 2017-12-12 21:29
  • 258
    个人资料
    • 访问:126282次
    • 积分:4547
    • 等级:
    • 排名:第7745名
    • 原创:318篇
    • 转载:20篇
    • 译文:0篇
    • 评论:16条
    博客专栏