Created
November 20, 2017 16:22
-
-
Save madcoder2k17/80e800b19865c04e94771558d72663d0 to your computer and use it in GitHub Desktop.
Codechef : Bear and segment 1 : https://www.codechef.com/problems/SEGM01
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<string.h> | |
#include<stdio.h> | |
int main() | |
{ | |
char s[100000]; | |
int n,count=0,i,T,o=0,c=0; | |
scanf("%d",&T); | |
while(T--) | |
{ | |
c = 0, o = 0, count=0; | |
scanf("%s",&s); | |
n = strlen(s); | |
for(i=0; i<n-1; i++) | |
{ | |
if((s[i]=='0'&&s[i+1]=='1')||(s[i]=='1'&&s[i+1]=='0')) | |
count++; | |
if(s[i]=='0') | |
o++; | |
if(s[i]=='1') | |
c++; | |
} | |
if(s[n-1]=='0') | |
o++; | |
else | |
c++; | |
if((count>2)||((s[0]=='1')&&(s[n-1]=='1')&&(o!=0))||(o==n)) | |
printf("NO\n"); | |
else | |
printf("YES\n"); | |
} | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment