https://i1.wp.com/eblogarithm.com/wp-content/uploads/2017/11/Codeforces-Round-444-Div-2-problem-A-Div-64-Solution-In-CC1.png?fit=640%2C360

Codeforces Round #444 (Div. 2), problem: (A) Div. 64 Solution In C/C++

#include<stdio.h>

char s[107];

int main()
{
scanf(” %s”,s);
int x=0,y=0,z=0;
while(s[x]==’0′) x++;
while(s[z]!=0) z++;
for(int i=x+1;i<z;i++) if(s[i]==’0′) y++;
if(y>=6) printf(“yes”);
else printf(“no”);

return 0;
}

(Visited 21 times, 1 visits today)



There are no comments

Add yours

Leave a Reply

%d bloggers like this: