fork(2) download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define mod                   1000000007
  4. #define ll                    long long
  5. #define Author                std::ios_base::sync_with_stdio(0);
  6. #define ABHISHEK_SHARMA       cout.tie(0);
  7. #define IIIT_ALLAHABAD        cin.tie(0);
  8. #define u_map                 unordered_map<ll,ll>
  9. #define n_map                 map<ll,ll>
  10. #define n_pair                pair<ll,ll>
  11. #define all(v)                v.begin(),v.end()
  12. #define forP(i,j,k)           for(i=j; i<k; i++)
  13. #define forN(i,j,k)           for(i=j; i>k; i--)
  14. #define pb(a)                 push_back(a)
  15. #define lb(v,t)               lower_bound(all(v),t)-v.begin()
  16. #define ub(v,t)               upper_bound(all(v),t)-v.begin()
  17.  
  18. //mainly used functions
  19. bool prime[10000001];
  20. ll abst(ll a){if(a<0)return -a; return a;}
  21. ll power(ll a, ll b){ll res=1;while(b){if(b&1)res=res*a;a=a*a;b/=2;}return res;}
  22. ll invmod(ll a){return power(a,mod-2);}
  23. ll lcm(ll a, ll b){return a*b/__gcd(a,b);}
  24. ll ncr(ll n, ll r){ll p=1;ll i;for(i=1; i<=r; i++){p*=(n-i+1);p*=i;}return p;}
  25. void sieve(){ll i;ll j;memset(prime,true,10000000);prime[0]=prime[1]=false;for(i=2; i*i<=10000000; i++){if(prime[i]){for(j=2*i; j<=10000000; j+=i){prime[j]=false;}}}}
  26.  
  27. int main(){
  28.     //Booster
  29.     Author
  30.         ABHISHEK_SHARMA
  31.         IIIT_ALLAHABAD
  32.     //Driver Code here
  33.     ll n, i, t, l, j;
  34.     cin>>n;
  35.     map<string,ll>mp;
  36.     string s, dum;
  37.     cin>>s;
  38.     mp[s]=1;         // mark first string
  39.     l=s.length();
  40.     ll p=l/2;        
  41.     vector<string>v;
  42.     while(1){      /*computing all possible strings until it start repeating*/
  43.         j=1;    
  44.         dum=s;
  45.         for(i=l-1; i>p; i--){      //perform operation as given in question
  46.             string a="";
  47.             a=a+dum[i];
  48.             s.insert(j,a);       
  49.             j+=2;
  50.         }
  51.         s.erase(l);
  52.         v.push_back(s);         //store all possible string in v
  53.         if(mp[s]==1){           //check if starts repeating
  54.             break;
  55.         }
  56.     }
  57.     l=v.size();
  58.     n=n%l;                       
  59.     cout<<v[l-1-n];
  60.     return 0;
  61. }
Success #stdin #stdout 0s 25008KB
comments (?)
stdin
copy 
3
hrrkhceaate
stdout
copy 
hackerearth
https://ideone.com/BUYw8x
language:
C++14 (gcc 8.3)
created:
5 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!