Submission #13346

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
133462015-02-12 14:57:14woqja125Three Friends (BOI14_friends)C++98
100 / 100
26 ms3036 KiB
#include<stdio.h>
char s[2000010];
int main()
{
int n, n2, cnt = 0, i;
scanf("%d%s", &n, s);
if(n%2 == 0)
{
printf("NOT POSSIBLE\n");
return 0;
}
n2 = n/2;
int ch = 0;
for(i=n2+1; i<n; i++)
{
if(ch == 0 && s[i-n2-1] == s[i]) continue;
else if(ch == 0 && s[i-n2] == s[i]) ch++;
else if (ch == 0) break;
else if (ch == 1 && s[i-n2] != s[i]) break;
}
if(i==n) cnt++;
ch = 0;
for(i=0; i<n2; i++)
{
if(ch == 0 && s[i+n2] == s[i]) continue;
else if(ch == 0 && s[i+n2+1] == s[i]) ch++;
else if(ch == 0) break;
else if(ch == 1 && s[i+n2+1] != s[i]) break;
}
if(i==n2)
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...