344A-magnet(A.Magnet)
#include<iostream>
using namespace std;
int main()
{
int n,z=1;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)cin>>arr[i];
int in=arr[0];
for(int i=1;i<n;i++)
{
if(arr[i-1]!=arr[i]){
z++;
}
}
cout<<z<<endl;
}
798A - Mike and palindrome
798A - . Mike and palindrome memory limit per test 256 megabytes input standard input output standard output Mike has a string s consisting of only lowercase English letters. He wants to change exactly one character from the string so that the resulting one is a palindrome. A palindrome is a string that reads the same backward as forward, for example strings " z ", " aaa ", " aba ", " abccba " are palindromes, but strings " codeforces ", " reality ", " ab " are not. Input The first and single line contains string s ( 1 ≤ | s | ≤ 15 ). Output Print " YES " (without quotes) if Mike can change exactly one character so that the resulting string is palindrome or " NO " (wi...
Comments
Post a Comment