https://vjudge.net/contest/258290#problem/B #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<map> #include<set> #include<vector> #include<stack> #include<queue> #define INF 0x3f3f3f3f #define ONF 0xc0c0c0c0 using namespace std; typedef long long ll; const int maxn=100; int len; int solve(int b[]) { int cnt=0; for(int i=0;i<len-1;i++) { b[i]%=2; if(b[i]==1) { b[i+1]++; b[i+2]++; cnt++; } } if(b[len-1]%2==1) return -1; return cnt; } int main() { char str[50]; int a[50],b[50]; while(scanf("%s",str)!=EOF) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); len=strlen(str); if(len==1) { if(str[0]=='0') cout<<0<<endl; else cout<<1<<endl; continue; } for(int i=0;i<len;i++) a[i]=str[i]-'0'; for(int i=0;i<len;i++) b[i]=a[i]; int ans=maxn; int k=solve(b); if(k>=0) ans=min(ans,k); for(int i=0;i<len;i++) b[i]=a[i]; b[0]=(b[0]+1)%2;b[1]=(b[1]+1)%2; k=solve(b); if(k>=0){ k++; ans=min(ans,k); } if(ans==maxn) cout<<"NO"<<endl; else cout<<ans<<endl; } }