uva 7096 A Rational Sequence（思维）_网用晴7096a1-CSDN博客

这篇博客介绍了UVA 7096题目，涉及到一个由正有理数标记的无限满二叉树。按照层次遍历（广度优先）定义了一个有理数序列，并要求根据输入的有理数找到序列中的下一个数。文章详细分析了三种情况，包括最右侧列、左子树和右子树其他情况的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

7096 A Rational Sequence
An infinite full binary tree labeled by positive rational numbers is defined by:
• The label of the root is 1/1.
• The left child of label p/q is p/(p+q).
• The right child oflabel p/q is (p+q)/q.
在这里插入图片描述
The top of the tree is shown in the following figure:
A rational sequence is defined by doing a level order (breadth first) traversal of the tree (indicated by the light dashed line). So that: F(1) = 1/1, F(2) = 1/2, F(3) = 2/1, F(4) = 1/3, F(5) = 3/2, F(6) = 2/3, . . .
Write a program which takes as input a rational number, p/q, in lowest terms and finds the next rational number in the sequence. That is, if F(n) = p/q, then the result is F(n + 1).
Input
The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the number of data sets that follow. Each data set should be processed identically and independently.
Each data set consists of a single line of input. It contains the data set number, K, which is then followed by a space, then the numerator of the fraction, p, followed immediately by a fonward slash (/), followed immediately by the denominator of the fraction, q. Both p and q will be relatively prime and 0 ≤ p, q ≤ 2147483647.
Output
For each data set there is a single line of output. It contains the data set number, K, followed by a single space which is then followed by the numerator of the fraction, followed immediately by a forward slash (‘/’) followed immediately by the denominator of the fraction. Inputs will be chosen such that neither the numerator nor the denominator will overflow a 32-bit integer.

Sample Input
5
1 1/1
2 1/3
3 5/2
4 2178309/1346269
5 1/1OOOOOOO
Sample Output
1 1/2
2 3/2
3 2/5
4 1346269/1860498
5 10000000/9999999

题意：一个点是p/q，它的左子树是p/p+q，右子树是p+q/q，已知某个点的值，求它的下一个点的值
想了好久好久，一开始想的是一层一层的求到第一个，记录下这个的编号，再求他的下一个，最后还是RE了
其实分为三种情况
（1）最右边的一列，他的下一个就是1/p+1
(2) 是左子树，他的下一个就是q/q-p
(3) 右子树的其他情况，一直想不到这种。找离他最近的左子树，记录层数差距，再一直找他兄弟的左子树就阔以了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <map>
#include<stack>
using namespace std;
#define ll long long
#define eps 0.001
#define INF 0x3f3f3f3f
#define PI acos(-1.0)
#define memset(a,b) memset(a,b,sizeof(a))
ll ans=0;
ll p=1,q=1;

int main()
{
    int t,num;
    ll a,b;
    char c;
    cin>>t;
    for(int i=1; i<=t; i++)
    {
        ans=0;
        cin>>num>>a>>c>>b;

        if(a<b)
        {
            p=b;
            q=b-a;
        }
        else if(b==1)
        {
            p=1;
            q=a+1;
        }
        else
        {
           while(a>b)
           {
               a=a-b;
               b=b;
               ans++;
           }
           p=b;
           q=b-a;

           q=ans*p+q;
        }

        cout<<num<<" "<<p<<"/"<<q<<endl;
    }


    return 0;
}