110507 The Stern-Brocot Number System


#include <iostream>

using namespace std;

class SternBrocotNo
{
public:
	SternBrocotNo(int x, int y) : m_x(x), m_y(y) {}

	SternBrocotNo(const SternBrocotNo& other) : m_x(other.m_x), m_y(other.m_y) {}

	bool operator == (const SternBrocotNo& other) const
	{
		return (m_x == other.m_x) && (m_y == other.m_y);
	}

	static SternBrocotNo GetMid(const SternBrocotNo& left, const SternBrocotNo& right)
	{
		return SternBrocotNo(left.m_x + right.m_x, left.m_y + right.m_y);
	}

	bool operator > (const SternBrocotNo& other) const
	{
		return (m_x * other.m_y) > (m_y * other.m_x);
	}

private:
	int m_x, m_y;
};

static void OutputSeq(
	const SternBrocotNo& target, const SternBrocotNo& mid, 
	const SternBrocotNo& left, const SternBrocotNo& right)
{
	if (target == mid)
	{
		cout << endl;
		return;
	}

	if (target > mid)
	{
		cout << 'R';
		SternBrocotNo newMid = SternBrocotNo::GetMid(mid, right);
		OutputSeq(target, newMid, mid, right);
	}
	else
	{
		cout << 'L';
		SternBrocotNo newMid = SternBrocotNo::GetMid(left, mid);
		OutputSeq(target, newMid, left, mid);
	}
}

static void Test()
{
	SternBrocotNo left(0, 1), right(1, 0), mid(1, 1);

	int x, y;
	while(true)
	{
		cin >> x >> y;

		if ((x * y) == 1)
			return;

		SternBrocotNo target(x, y);
		OutputSeq(target, mid, left, right);
	}
}

int main(int argc, char* argv[])
{
	Test();
	return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值