#include<iostream> #include<queue> #include<vector> #include<cmath> using namespace std; int main() { int n; cin >> n; vector<string> res; queue<string> q; for(int i = 0;i < n;i ++) { string s1; cin >> s1; res.push_back(s1); } int w, s; string sss; cin >> sss; int index; for(int i= 0;i < sss.size();i ++) { if(sss[i] == ',') { index = i; break; } } for(int i = 0;i < index;i ++) { w = (sss[i]-'0')*pow(10,index-i-1); } for(int i = index+1;i < sss.size();i ++) { s = (sss[i]-'0')*pow(10,sss.size()-1-i); } //cout << w << " " << s << endl; for(int i = w-1;i < res.size();i ++) q.push(res[i]); for(int i = 0;i < w-1;i ++) q.push(res[i]); int cnt = 1; while(1) { string str = q.front(); q.pop(); if(cnt == s) { cnt = 1; if(q.empty()) { cout << str; break; } else { cout << str << endl; } } else { cnt ++; q.push(str); } } return 0; } |
Double click to view unformatted code.