Cho mot so nhi phan, tim luy thua cao nhat cua 2 la uoc cua so nay

Given a binary number (of N bits) X

. Find the highest power of 2 that divides this number.

Note: If the binary number is "100" then the highest power of 2 that divides it is 2 (as 22 = 4)

Input:

• The first line contains N the number of bits in the number
• The next line contains a binary number of N bits

Output:

• The first and only line contains the max power of 2 that divides the given number

Constraints:

• 1≤N≤105

1≤X

• 
  

Sample Input:

5
10100

Sample Output:

2

Author: 5★kalpitk

Tags: kalpitk

Date Added: 7-04-2019

Time Limit: 1 secs

Source Limit: 50000 Bytes

Languages: C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, R, COB, FS

/**************************/

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int a;
    cin>>a;
    string s;
    int ans,i;
    cin>>s;
    for(i=s.length()-1;i>=0;i--)
    {
        // cout<<i<<endl;
        if(s[i] == '1')
        {
            // cout<<"specific i"<<i<<endl;
            ans = s.length() - i-1;
            break;
        }
    }
    cout<<ans;
    return 0;
}