codeforces134 div1 B

最新推荐文章于 2025-01-20 09:00:00 发布

magicnumber

最新推荐文章于 2025-01-20 09:00:00 发布

阅读量1.8k

点赞数

CC 4.0 BY-SA版权

文章标签： div output numbers character up input

本文链接：https://blog.youkuaiyun.com/magicnumber/article/details/7884021

本文介绍了一种通过交替操作来计算斐波那契数的方法，并探讨了如何找到导致特定结果的最少错误次数及操作序列。

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

codeforces div1 B / codeforces div2 D

Fibonacci numbers are the sequence of integers: f₀ = 0, f₁ = 1, f₂ = 1, f₃ = 2, f₄ = 3, f₅ = 5, ..., f_n = f_n - 2 + f_n - 1. So every next number is the sum of the previous two.

Bajtek has developed a nice way to compute Fibonacci numbers on a blackboard. First, he writes a 0. Then, below it, he writes a 1. Then he performs the following two operations:

operation "T": replace the top number with the sum of both numbers;
operation "B": replace the bottom number with the sum of both numbers.

If he performs n operations, starting with "T" and then choosing operations alternately (so that the sequence of operations looks like "TBTBTBTB..."), the last number written will be equal to f_n + 1.

Unfortunately, Bajtek sometimes makes mistakes and repeats an operation two or more times in a row. For example, if Bajtek wanted to compute f₇, then he would want to do n = 6 operations: "TBTBTB". If he instead performs the sequence of operations "TTTBBT", then he will have made 3 mistakes, and he will incorrectly compute that the seventh Fibonacci number is 10. The number of mistakes in the sequence of operations is the number of neighbouring equal operations («TT» or «BB»).

You are given the number n of operations that Bajtek has made in an attempt to compute f_n + 1 and the number r that is the result of his computations (that is last written number). Find the minimum possible number of mistakes that Bajtek must have made and any possible sequence of n operations resulting inr with that number of mistakes.

Assume that Bajtek always correctly starts with operation "T".

Input

The first line contains the integers n and r (1 ≤ n, r ≤ 10⁶).

Output

The first line of the output should contain one number — the minimum possible number of mistakes made by Bajtek. The second line should contain n characters, starting with "T", describing one possible sequence of operations with that number of mistakes. Each character must be either "T" or "B".

If the required sequence doesn't exist, output "IMPOSSIBLE" (without quotes).

Sample test(s)

input
6 10

output
2
TBBTTB

input
4 5

output
0
TBTB

input
2 1

output
IMPOSSIBLE

比赛的时候没想清楚，后来发现其实很简单的。

最后要到达数字r，那么另一个数一定比r小，且另一个数确定之后，那么转移过程也就确定了，所以就可以枚举另外这个数，然后模拟转移过程判断符不符合条件，如果符合条件的话，再保存路径输出结果就行了。

转移的过程如果遇上要一直覆盖某一个数，那就直接用除法，而不一步步模拟，这样就会很快了。

代码：

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

#define INF 100000000

int n,s,num;
char ans[1000005];

void Check(int x,int y)
{
    int p,t=0;
    int k=0;
    int ret=x;
    while(1)
    {
        if (x<y)
        {
            p=x;
            x=y;
            y=p;
        }
        if (x==y || y==0) break;
        k++;
        t+=x/y;
        x=x%y;
    }
    if (x!=1 || y!=0) return;
    if (t==n && s<k)
    {
        s=k;
        num=ret;
    }
}

int main()
{
    int i,j,t,r;
    scanf("%d%d",&n,&r);
    if (n==1 && r==1)
    {
        printf("0\nT\n");
        return 0;
    }
    s=-INF;
    for (i=1;i<r;i++)
    {
        Check(i,r);
    }
    if (s==-INF)
    {
        printf("IMPOSSIBLE\n");
        return 0;
    }
    printf("%d\n",n-s-1);
    int x=num,y=r,up=0;
    while(1)
    {
        if (x==1 && y==1) break;
        if (x<y)
        {
            ans[up++]='T';
            y-=x;
        }
        else
        {
            ans[up++]='B';
            x-=y;
        }
    }
    printf("T");
    for (i=up-1;i>=0;i--)
    {
        if (ans[up-1]=='B') printf("%c",ans[i]);
        else printf("%c",ans[i]=='T'?'B':'T');
    }
    return 0;
}