Кодовое слово

#pragma once
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define rsor(n) n.rbegin(), n.rend()
#define mp make_pair
#define files freopen("input.txt", "rt", stdin); freopen("output.txt", "wt", stdout)
#define p(T) pair<T,T>
#define toch(x) cout.precision(x), cout.setf(ios::fixed)
#define znac(l) abs(l)/l
#define IOS ios::sync_with_stdio(false)
#define IOSB cin.tie(0), cout.tie(0);
const ll ok = ll(1e9 + 7);

int main()
{
    IOSB;
    IOS;
#ifdef TheCompiler
    files;
#endif
    ll n;
    cin >> n;
    string s;
    while (cin >> s)
    {
        if (s.size() == n)
        {
            ll sum = 0;
            for (int i = 0; i < s.size(); i++)
            {
                if (s[i] == '1')
                {
                    sum += i + 1;
                }
            }
            if (sum % (n + 1) == 0)
            {
                cout << s << endl;
            }
            else
            {
                s[sum % (n + 1) - 1] = '0';
                cout << s << endl;
            }
        }
        else
        {
            vector<p(ll)>prev;
            ll sum = 0;
            ll sc = 0;
            for (int i = 0; i < s.size(); i++)
            {
                if (s[i] == '1')
                {
                    sc++;
                    sum += i + 1;
                }
                prev.push_back({ sc,sum });
            }
            if (s.size() > n)
            {
                for (int i = 0; i < s.size(); i++)
                {
                    sum = 0;
                    if (i != 0)
                    sum = prev[i - 1].second;
                    sum += prev[n].second - prev[i].second - (prev[n].first - prev[i].first);
                    if (sum % (n + 1) == 0)
                    {
                        s.erase(i,1);
                        break;
                    }
                }
                cout << s << endl;
            }
            else
            {
                string h = "";
                if ((prev[n - 2].second + prev[n - 2].first + 1) % (n + 1) == 0)
                {
                    cout << "1" << s << endl;
                    continue;
                }
                if ((prev[n - 2].second + prev[n - 2].first) % (n + 1) == 0)
                {
                    cout << "0" << s << endl;
                    continue;
                }
                if ((prev[n - 2].second + n) % (n + 1) == 0)
                {
                    cout << s << "1" << endl;
                    continue;
                }
                if ((prev[n - 2].second) % (n + 1) == 0)
                {
                    cout << s << "0" << endl;
                    continue;
                }
                h = s[0];
                for (int i = 1; i < s.size(); i++)
                {
                    sum = 0;
                    sum = prev[i - 1].second;
                    sum += prev[n - 2].second - prev[i-1].second + (prev[n - 2].first - prev[i-1].first);
                    if ((sum+i+1) % (n + 1) == 0)
                    {
                        h += "1";
                        while (i < s.size())
                        {
                            h += s[i];
                            i++;
                        }
                        break;
                    }
                    else
                        if (sum % (n + 1) == 0)
                        {
                            h += "0";
                            while (i < s.size())
                            {
                                h += s[i];
                                i++;
                            }
                            break;
                        }
                    h += s[i];
                }
                cout << h << endl;
            }
        }
    }
    return 0;
}