# ZJNU 1900 Secret Cow Code 想法题 倒推

## Secret Cow Code

Time Limit: 3000MS Memory Limit: 3000K
Total Submissions: 65 Accepted: 18
Description

The cows are experimenting with secret codes, and have devised a method for creating an infinite-length string to be used as part of one of their codes.

Given a string s, let F(s) be s followed by s “rotated” one character to the right (in a right rotation, the last character of s rotates around and becomes the new first character). Given an initial string s, the cows build their infinite-length code string by repeatedly applying F; each step therefore doubles the length of the current string.

Given the initial string and an index N, please help the cows compute the character at the Nth position within the infinite code string.

Input

The input consists of a single line containing a string followed by NN. The string consists of at most 30 uppercase characters, and N≤1018$10^{18}$.

Note that N may be too large to fit into a standard 32-bit integer, so you may want to use a 64-bit integer type (e.g., a “long long” in C/C++).

Output

Please output the Nth character of the infinite code built from the initial string. The first character is N=1.

Sample Input

COW 8
Sample Output

C
Hint

In this example, the initial string COW expands as follows:

COW -> COWWCO -> COWWCOOCOWWC

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mm=1e18;
char s[35];
ll n,a[100],pl;
int main(){
scanf("%s%lld",s,&n);
ll l=strlen(s);
a[1]=l;
for(ll i=2;;i++){
a[i]=a[i-1]*2;
if(a[i]>n){
pl=i;
break;
}
}
while(1){
if(n<=l){
break;
}
ll p=lower_bound(a,a+pl,n)-a-1;
n=n-a[p]-1;
if(n==0)    n=a[p];
}
printf("%c\n",s[n-1]);
return 0;
}

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客