1087A - Right-Left Cipher - CodeForces Solution

#include<bits/stdc++.h>
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;

void solve()
{
   string s, s1;
   cin >> s;
   
   int l= (s.size()-1)/2;
   int r=l+1;
for(int i=0;i<s.length();i++)
{
    if(i%2==0){
        s1+=s[l];
        l--;
    }
    else{
        s1+=s[r];
        r++;
    }
}

   
   cout << s1<< endl;
}

int main()
{
    optimize();
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}