фибоначя

#include <iostream>
#include <string>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <vector>
#include <set>
#include <iterator>
#include <map>
#include <iomanip>
#define int long long
#define fir first
#define sec second
#define sp system("pause")
#define pb push_back
#define double long double
#define endl "\n"
#define un unsigned
using namespace std;

int ans[100];
int n, k;

void opopo()
{
    ans[0] = 0;
    ans[1] = 2;
    ans[2] = 3;

    for (int i = 3; i < n; i++)
    {
        ans[i] = ans[i - 1] + ans[i - 2];
    }

    return;
}

void out(int n, int k)
{
    if (n <= 0)
    {
        return;
    }

    if (n == 1)
    {
        if (k == 1)
        {
            cout << "0";
            return;
        }
        else
        {
            cout << "1";
            return;
        }
    }

    if (ans[n - 1] >= k)
    {
        cout << "0";
        out(n - 1, k);
    }
    else
    {
        cout << "10";
        out(n - 2, k - ans[n - 1]);
    }
    return;
}

signed main() {
    ios_base::sync_with_stdio();
    cin.tie(0);
    cout.tie(0);

    cin >> n >> k;

    opopo();
    out(n, k + 1);
    cout << endl;
    //sp;
    return 0;
}