定义一个二叉树,根节点(1,1),设根节点(a,b),左儿子是(a+b,b),右儿子(a,b+a)
现在个你一个点(i,j),问从(1,1)走到(i,j)要向左多少次,向右多少次?
input:
3
42 1
3 4
17 73
output:
Scenario #1:
41 0
Scenario #2:
2 1
Scenario #3:
4 6
代码:
include<iostream>
include<cmath>
include<cstring>
include<algorithm>
using namespace std;
int main()
{
int N = 0;
int i = 0;
cin >> N;
while(N > 0)
{
N--;
i++;
int a = 0;
int b = 0;
cin >> a >> b;
int l = 0;
int r = 0;
while(a != b)
{
int temp = 0;
if(a > b)
{
temp = a%b;
if(temp == 0)
{
l += a/b-1;
a = 1;
}
else
{
l += a/b;
a = temp;
}
}
else
{
temp = b%a;
if(temp == 0)
{
r += b/a-1;
b = 1;
}
else
{
r += b/a;
b = temp;
}
}
}
cout << "Scenario #" << i << ":" << endl << l << " " << r << end;
}
}
理解
这并
不是真的二叉树,再想想怎么做。在看题的是向左,向右多少次,我一想,那我倒着找回去不就好了。。。。结果TLE。。。后来知道了,用减法倒着推回去,太复杂了,而平时既然加法能用乘法优化,那我减法为什么不用除法呢?结果又TLE了。。。经过巨巨指导,才明白,是忘了取膜和除法里0的影响,最终AC了。。。