This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pii pair<int,int>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define int long long
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
const int N = 3e5 + 5 ;
const int inf = 1e17 + 7;
const int mod = 998244353;
int n,m,k;
void solve(){
string str;
cin>>str;
string l,r;
int i = 0,j = str.size() - 1;
int ans = 0;
while(i < j){
l += str[i];
r = str[j] + r;
i += 1;
j -= 1;
//~ cout<<l<<" "<<r<<"\n";
if(l == r){
ans += 2;
l = "";
r = "";
}
}
if(l != "" && r != "" || i == j)ans += 1;
cout<<ans<<"\n";
}
signed main()
{
// freopen("seq.in", "r", stdin);
// freopen("seq.out", "w", stdout);
ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
int tt=1;cin>>tt;
while(tt--)solve();
}
Compilation message (stderr)
palindromic.cpp: In function 'void solve()':
palindromic.cpp:49:13: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
49 | if(l != "" && r != "" || i == j)ans += 1;
| ~~~~~~~~^~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |