Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round) B. World Cup

B. World Cup
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
The last stage of Football World Cup is played using the play-off system.

There are n teams left in this stage, they are enumerated from 1 to n. Several rounds are held, in each round the remaining teams are sorted in the order of their ids, then the first in this order plays with the second, the third — with the fourth, the fifth — with the sixth, and so on. It is guaranteed that in each round there is even number of teams. The winner of each game advances to the next round, the loser is eliminated from the tournament, there are no draws. In the last round there is the only game with two remaining teams: the round is called the Final, the winner is called the champion, and the tournament is over.

Arkady wants his two favorite teams to play in the Final. Unfortunately, the team ids are already determined, and it may happen that it is impossible for teams to meet in the Final, because they are to meet in some earlier stage, if they are strong enough. Determine, in which round the teams with ids a and b can meet.

Input
The only line contains three integers n, a and b (2 ≤ n ≤ 256, 1 ≤ a, b ≤ n) — the total number of teams, and the ids of the teams that Arkady is interested in.

It is guaranteed that n is such that in each round an even number of team advance, and that a and b are not equal.

Output
In the only line print “Final!” (without quotes), if teams a and b can meet in the Final.

Otherwise, print a single integer — the number of the round in which teams a and b can meet. The round are enumerated from 1.

Examples
inputCopy
4 1 2
output
1
inputCopy
8 2 6
output
Final!
inputCopy
8 7 5
output
2
Note
In the first example teams 1 and 2 meet in the first round.

In the second example teams 2 and 6 can only meet in the third round, which is the Final, if they win all their opponents in earlier rounds.

In the third example the teams with ids 7 and 5 can meet in the second round, if they win their opponents in the first round.

题意

就是一个单淘汰赛制,给你一开始两个队的队号求他们最早会在哪一轮相遇

思路

两队是否能相遇的算法可以参考单淘汰赛制两队相遇算法直接套公式,枚举轮数即可

#include <iostream>
#include <cstring>
#include <algorithm>
#include <stdio.h>
#include <math.h>
using namespace std;
int main()
{
    int n,j,k;
    while(scanf("%d%d%d",&n,&j,&k)!=EOF)
    {
        for(int i=1;(1<<i)<=n;i++)
        {
            if((1<<i==n)&&(((j-1)>>(i-1))^1)==((k-1)>>(i-1)))
            {
                printf("Final!\n");
                break;
            }
            else if((((j-1)>>(i-1))^1)==((k-1)>>(i-1)))
            {
                printf("%d\n",i);
                break;
            }
        }
    }
    return 0;
}