0分RE求条

#include <bits/stdc++.h>
using namespace std;
const int N = 35;
char ch[N];
int main()
{
    int i = 0, cnt = 0;
    cin >> ch[i];
    while (1)
    {
        if (ch[i] == ' ')
        {
            break;
        }
        i++, cnt++;
        cin >> ch[i];
    }
    long long max = 1;
    long long n;
    cin >> n;
    long long flag = n / cnt + 1;
    while (max < flag)
    {
        max <<= 1;
    }
    max *= cnt;
    long long x = n - (max >> 1);
    while (n > cnt)
    {
        if (x == 1)
        {
            n--;
        }
        if (x > 1)
        {
            n = n - (max >> 1) - 1;
        }
        max >>= 1;
        x = n - (max >> 1);
    }
    cout << ch[n - 1] << endl;
    return 0;
}