洛谷P3612 [USACO17JAN]Secret Cow Code S进阶解法

#include<iostream>

using namespace std;
long long N;
string s;

char find(string& s, long long& N)
{
	long long l = s.length();
	for (; l < N; l *= 2)
	{
	}
	for (;;)
		if (N <= s.length())
			return s[N - 1];
		else
		{
			if (N > l / 2)
				if (1 == N - l / 2)
					N = l / 2;
				else
					N = N - l / 2 - 1;
			l /= 2;
		}
	return '\a';
}

int main()
{
	cin >> s >> N;
	cout << find(s, N);
	return 0;
}