Codeforces-SolutionsA/Codes/1367 A - Short Substrings/1367A.cpp

27 lines
541 B
C++
Raw Normal View History

2024-05-25 04:28:54 +08:00
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;}
void solve()
{
string s;
cin>>s;
cout<<s[0];
for(int i=1; i<s.size()-1; i+=2)
cout<<s[i];
cout<<s.back()<<endl;
}
signed main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int TCS = 1;
cin >> TCS;
for (int TC = 1; TC <= TCS; ++TC)
{
// cout<<"Case "<<TC<<": ";
solve();
}
}