Problem:
Score : 200 points

Problem Statement

Given are a positive integer N and a string S of length N consisting of lowercase English letters.

Determine whether the string is a concatenation of two copies of some string.
That is, determine whether there is a string T such that S = T + T.

Constraints

1 \leq N \leq 100

S consists of lowercase English letters.

|S| = N

Input

Input is given from Standard Input in the following format:

N
S

Output

If S is a concatenation of two copies of some string, print Yes; otherwise, print No.

Sample Input 1

6
abcabc

Sample Output 1

Yes

Let T = abc, and S = T + T.

Sample Input 2

6
abcadc

Sample Output 2

No

Sample Input 3

1
z

Sample Output 3

No

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include<string.h>

using namespace std;

int main()
{
    int size, count=0;
    cin>>size;
    char str[size];
    cin>>str;
    if(size>1)
    {
        char str1[size/2]= {'\0'}, str2[size/2]= {'\0'};
        for(int i=0; i<size/2;i++)
        {
            str1[i]=str[i];
        }
        for(int i=size/2;i<size;i++)
        {
            str2[count]=str[i];
            count++;
        }
        for(int i=0; i<size/2;i++)
        {
            if(str1[i]==str2[i])
                count=1;
        }
        if(count==1)
            cout<<"Yes";
        else
            cout<<"No";
    }
    else
        cout<<"No";

    return 0;
}