Submission #59868753

---

Source Code Expand

#if !__INCLUDE_LEVEL__
#include __FILE__



int main(){
    string S; cin>>S;
    ll l = S.length();
    ll Q; cin>>Q;

    rep(i,0,Q){
        ll K;cin>>K;K--;
        ll k = (ll)(K/l)+1;
        bool omote = true;
        ll b = 1;
        while(1){
            b *= 2;
            if(b>K)break;
        }
        while(1){
            if (b==1)break;
            if(k > (ll)(b/2)){
                omote = !omote;
                k-=(ll)(b/2);
            }
            b /= 2;
        }

        ll idx = K%l;
        if(omote){cout<<S[idx]<<spa;}
        else{
            if(isupper(S[idx]))cout<<(char)(S[idx]+32)<<spa;
            else cout<<(char)(S[idx]-32)<<spa;
        }
    }
    cout<<endl;
    
    return 0;
}

#else
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;

#define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++)
#define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )

const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";

//配列の要素を空白区切りで出力 第二引数をtrueにすると改行区切り
template<class T> inline void print_vec(const vector<T>& v, bool split_line=false) {
    if(v.empty()){
        cout << "This vector is empty." << el;
        return;
    }
    for (int i = 0; i < v.size(); i++) {
        if(v[i]==inf || v[i]==infl) cout << 'x' << " \n"[split_line || i+1==(int)v.size()];
        else cout << v[i] << " \n"[split_line || i+1==(int)v.size()];
    }
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

#endif

Submission Info

Judge Result