Sponsors

Tag: Codeforces Round #410 (Div. 2)

Codeforces Round #410 (Div....

#pragma warning(disable:4996) #include <stdio.h> #include <iostream> #include <iomanip> #include <vector> #include <algorithm> #include <string.h> #include <stdlib.h> #include...

Codeforces Round #410 (Div....

#include<bits/stdc++.h> using namespace std; const int maxn=100000+10; int b,n,flag=1,dp; struct node { int id,x; }a; int cmp(node...

Codeforces Round #410 (Div....

#include <bits/stdc++.h> using namespace std; int main(){ int n, num = 0,...

Codeforces Round #410 (Div....

#include <bits/stdc++.h> using namespace std; string s; int main() { int n, t, ans; ans...

Codeforces Round #410 (Div....

#include<iostream> using namespace std; main() { string s;cin>>s; int n=s.size(),cnt=0; for(int i=0;i<n/2;i++) { if(s!=s)cnt++; } cout<<(cnt==1||cnt==0&&n%2==1?"YES":"NO")<<endl; }

Advertisement

spot_img