Problem:


Score : 100 points

Problem Statement

Snuke has a grid consisting of three squares numbered 1, 2 and 3.
In each square, either 0 or 1 is written. The number written in Square i is s_i.

Snuke will place a marble on each square that says 1.
Find the number of squares on which Snuke will place a marble.

Constraints

Each of s_1, s_2 and s_3 is either 1 or 0.

Input

Input is given from Standard Input in the following format:

s_{1}s_{2}s_{3}

Output

Print the answer.

Sample Input 1

101

Sample Output 1

2

A marble will be placed on Square 1 and 3.

Sample Input 2

000

Sample Output 2

0

No marble will be placed on any square.



Sample input:
101


Sample output:
2

Submission status: Runtime Error

Solution code:
print(input()).count("1")

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
cnt = 0

while(True):
    
    if all(a % 2 == 0 for a in A):
        A = list(map(lambda x: x / 2, A))
        cnt += 1
    
    else: break

print(cnt)

Submission status: Runtime Error

Solution code:
cnt = 0

while(True):
    
    if all(a % 2 == 0 for a in A):
        A = list(map(lambda x: x / 2, A))
        cnt += 1
    
    else: break

print(cnt)

Submission status: Runtime Error

Solution code:
sss = input()
masu = list(sss)
counter = 0
if(masu[0] == 1):
    counter += 1
    elif (masu[1] == 1):
        counter += 1
    elif (masu[2] == 1):
        counter += 1
print(counter)

Submission status: Runtime Error

Solution code:
N = input()
A = list(map(int,input().split()))
#２の倍数かどうかを調べる関数　引数:4→True,5→False

def isAllEVEN(A):
    return (not (False in (list(map(lambda x:x%2==0,A)))))

i = 0
while(isAllEVEN(A)):
	A = list(map(lambda x:x/2,A))
    i++;
print(i)

Submission status: Runtime Error

Solution code:
N = input()
A = list(map(int,input().split()))
#２の倍数かどうかを調べる関数　引数:4→True,5→False

def isAllEVEN(A):
    return (not (False in (list(map(lambda x:x%2==0,A)))))

i = 0
while(isAllEVEN(A)):
A = list(map(lambda x:x/2,A))
    i++;
print(i)

Submission status: Runtime Error

Solution code:
def count2(number):
    count = 0
    while True:
        if number % 2 == 0:
            count = count + 1
            number = number / 2
        else:
            break
    return count

N = int(input())
A_list = list(map(int, input().split())) 

answer = min(list(map(count2, A_list)))
    
print(answer)

Submission status: Runtime Error

Solution code:
a = int(input())

count = 0
for i in range(len(a)):
  if a[i] == 1:
    count += 1

print(count)

Submission status: Runtime Error

Solution code:
n = input()
s = list(map(int, input().split()))
c = 0
while True:
        exist = False
        #print(s)
        for i in range(len(s)):
                #print(i)
                if s[i]%2 != 0:
                        exist = True

        if exist:
                print(c)
                break
        for i in range(len(s)):
                s[i] = s[i]/2
        c += 1

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int, input().split()))
B=A[:]
i=0
while i < N:
    if A[i] % 2 == 0:
        A[i] = A[i]//2
        if i == N - 1:
            B = A[:]
            i = -1
        i += 1
    else:
        break
print(B)

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int, input().split()))
B=A[:]
i=0
while i < N:
    if A[i] % 2 == 0:
        A[i] = A[i]//2
        print(A[i])
        if i == N - 1:
            B = A[:]
            i = -1
        i += 1
    else:
        break
print(B)

Submission status: Runtime Error

Solution code:
a=int(input())
b=list(map(int,input().split()))
counter=0
exist_odd=False
while True:
  count=0
  while count<=a-1:
    if b[count]%2==1:
      exist_odd=True
      break
    else:
      b[count]=b[count]//2
      count+=1
  if exist_odd:
    break
  else:
    counter+=1
print(counter)

Submission status: Runtime Error

Solution code:
list = list(input())
for i in len(list):
    n = 0:
    if int(list[i]) ==1:
        n += 1
print(n)

Submission status: Runtime Error

Solution code:
list = list(input())
for i in len(list):
    n = 0:
    if int(list[i]) ==1:
        n =+ 1
print(n)

Submission status: Runtime Error

Solution code:
list = list(input())
for i in len(list):
    n = 0:
    if list[i] ==1:
        n =+ 1
print(n)

Submission status: Runtime Error

Solution code:
s = input()
pirnt(s.count('1'))

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(i) for i in input().split(',')]

is_all_even = True
counter = 0
while True:
    for i, v in enumerate(A):
        if v % 2 == 0:
            A[i] = A[i] // 2
        else:
            is_all_even = False
    if is_all_even:
        counter += 1
    else:
        break
print(counter)

Submission status: Runtime Error

Solution code:

A = map(int, input().split(','))

N = int(input())
A = [int(i) for i in input().split(',')]

is_all_even = True
counter = 0
while True:
    for i in range(len(A)):
        if A[i] % 2 == 0:
            A[i] = int(A[i] // 2)
        else:
            is_all_even = False
    if is_all_even:
        counter += 1
    else:
        break
print(counter)

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(i) for i in input().split(',')]

is_all_even = True
counter = 0
while True:
    for i in range(len(A)):
        if A[i] % 2 == 0:
            A[i] = int(A[i] / 2)
        else:
            is_all_even = False
    if is_all_even:
        counter += 1
    else:
        break
print(counter)

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split(',')))

is_all_odd = True
counter = 0
while True:
    for i in range(len(A)):
        if A[i] % 2 == 0:
            A[i] = int(A[i] / 2)
        else:
            is_all_odd = False
    if is_all_odd:
        counter += 1
    else:
        break
print(counter)

Submission status: Runtime Error

Solution code:
def check(a,cnt):
  b = [int(x)%2 for x in a]
  if 1 in b:
    return 0,cnt
  else :
    cnt +=1
    b = [int(x)/2 for x in a]
    return 1,cnt
 
N = input()
a = input().split()
cnt = 0
while(1):
  m,cnt = check(a,cnt)
  if m == 0:
    print(cnt)
  else :
    continue

Submission status: Runtime Error

Solution code:
n = input()
a = list(map(int, input().split()))
flag = 0


for t in range(40):

    for i,j in enumerate(a):
        if j%2 == 0:
            a[i] = j/2

        else:
            flag = 1
            break

    if flag == 1:
        break

print(t)

Submission status: Runtime Error

Solution code:
import math
n = input()
a = list(map(int, input().split()))
flag = 0


for t in range(40):

    for i,j in enumerate(a):
        if j%2 == 0:
            a[i] = j/2

        else:
            flag = 1
            break

    if flag == 1:
        break

print(t)

Submission status: Runtime Error

Solution code:
import math
n = input()
a = list(map(int, input().split()))
flag = 0


for t in range(15):

    for i,j in enumerate(a):
        if j%2 == 0:
            a[i] = j/2

        else:
            flag = 1
            break

    if flag == 1:
        break

print(t)

Submission status: Runtime Error

Solution code:
import math
n = input()
a = list(map(int, input().split()))
flag = 0


for t in range(1000):

    for i,j in enumerate(a):
        if j%2 == 0:
            a[i] = j/2

        else:
            flag = 1
            break

    if flag == 1:
        break

print(t)

Submission status: Runtime Error

Solution code:
n = input()
a = list(map(int, input().split()))
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print(round(ans))

Submission status: Runtime Error

Solution code:
import math
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1"))
print(round(ans))

Submission status: Runtime Error

Solution code:
import math
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print(round(ans))

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))

count = 0
while sum(list(map(lambda x: x % 2, A))) == 0 :
    count += 1
    A = list(map(lambda x: x / 2, A))

print(count)

Submission status: Runtime Error

Solution code:
c=list(map(int, input().split()))
k = 0
for i in range(0,2):
  if (c[i] == "1"):
    k += 1
print(k)

Submission status: Runtime Error

Solution code:
a = input()
b = 0
if a[0] == 1:
    b++
if a[1] == 1:
    b++
if a[2] == 1:
    b++
print(b)

Submission status: Runtime Error

Solution code:
import numpy as np

n = input()
a = np.array(list(map(int, input().split())))

c = 0
s = 0

while s == 0:
    s += np.sum(a % 2)
    if s == 0:
        c += 1
        a = a/2
    else:
        break

print(c)

Submission status: Runtime Error

Solution code:
#%%
import numpy as np

#%%
n = input()
a = np.array(list(map(int, input().split())))

#%%
c = 0
s = 0

while s == 0:
    s += np.sum(a % 2)
    if s == 0:
        c += 1
        a = a/2
    else:
        break

print(c)

Submission status: Runtime Error

Solution code:
import numpy as np

#%%
n = int(input())
a = list(map(int, input.split()))

#%%
c = 0
s = 0

while s == 0:
    s += np.sum(a % 2)
    if s == 0:
        c += 1
        a = a/2
    else:
        break

print(c)

Submission status: Runtime Error

Solution code:
import sys
N=int(input())
a=[int(i) for i in input().split()]
t=0
while True:
  for i in range(N):
    if a[i]%2==0:
      a[i]//=2
    else:
      print(t)
      sys.exit()
  t+=1

Submission status: Runtime Error

Solution code:
import sys
N=int(input())
a=[int(i) for i in input().split()]
t=0
while True:
  for i in range(N):
    if a[i]%2==0:
      a[i]//=2
    else:
      print(t)
      sys.exit()
  t+=1

Submission status: Runtime Error

Solution code:
import sys
N=int(input())
a=[int(i) for i in input().split()]
t=0
while True:
  for i in range(N):
    if a[i]%2==0:
      a[i]//=2
    else:
      print(t)
      sys.exit()
	t+=1

Submission status: Runtime Error

Solution code:
import sys
N=int(input())
a=[int(i) for i in input().split()]
t=0
while True:
  for i in range(N):
    if a[i]%2==0:
      a[i]//=2
      t+=1
    else:
      print(t)
      sys.exit()

Submission status: Runtime Error

Solution code:
a=input()
c=0
for i in range(2):
  if a>=10**(2-i):
    a-10**(2-i)
    c+=1
print(c)

Submission status: Runtime Error

Solution code:
a = input()
a = int(a)

if(a==000):
    print(0)
elif(a==100)or(a==010)or(a==001):
    print(1)
elif(a==101)or(a==110)or(a==011):
    print(2)
else:
    print(3)

Submission status: Runtime Error

Solution code:
a = input()
a = int(a)

if(a=000):
    print(0)
elif(a=100)or(010)or(001):
    print(1)
elif(a=101)or(110)or(011):
    print(2)
else:
    print(3)

Submission status: Runtime Error

Solution code:
s1,s2,s3 = map(str, input().split())
x = [s1,s2,s3]
counter = 0
for i in x:
    if i == '1':
        counter += 1
print(counter)

Submission status: Runtime Error

Solution code:
s1,s2,s3 = map(int, input().split())
x = [s1,s2,s3]
counter = 0
for i in x:
    if i == 1:
        counter += 1
print(counter)

Submission status: Runtime Error

Solution code:
n = int(input())
A = list(map(int,input().split()))

c = 0
while all (a%2==0 for a in A):
    A = list(a//2 for a in A)
    c += 1
print(c)

Submission status: Runtime Error

Solution code:
n = int(input())
char_list = input().split()
num_list = list(map(int, char_list))

def is_even(lis):
    return [x for x in lis if x % 2]

mod2_list = is_even(num_list)

i = 0
while mod2_list == []:
    num_list = [x / 2 for x in num_list]
    mod2_list = is_even(num_list)
    i += 1
    
print(i)

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))ans=0
flag=0

while flag==0:
  for i in range(N):
    if A[i]&1==0:
      A[i]=A[i]>>1
    else:
      print(ans)
      flag=1
      break
  ans+=1

print(ans)

Submission status: Runtime Error

Solution code:
import sys
N = sys.stdin.readline().rstrip(); N = int(N)
A = []
cnt = 0
while cnt < N:
  element = sys.stdin.readline().rstrip()
  element = int(element)
  A.append(element)
  cnt += 1

ans = 0
while True:
  # check
  bool_check=True
  for i in xrange(N):
    if A[i] % 2 == 1:
      bool_check = False
      break
  if bool_check == False: break
  
  # update
  for i in xrange(N):
    A[i] /= 2
  ans += 1
print ans

Submission status: Runtime Error

Solution code:
shio = string(raw_input())
counter = 0
for i in 2:
  if shio[i] == "1":
    counter +=1
print(counter)

Submission status: Runtime Error

Solution code:
shio = string(raw_input())
counter = 0
for i in 2
	if shio[i] = "1":
    	counter+=1
print(counter)

Submission status: Runtime Error

Solution code:
shio = string(input())
x = 0
for i in shio:
  if shio = "0":
    x+=1

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int,input().split()))
c=0
T=True
for i in a:
    if (i%2)!=0:
        print(c)
        break
    else:
        while T:
            a=list(map(lambda x:x/2,a))
            c+=1
            b=list(map(lambda x:True if x%2==0 else False,a))
            T=b[False]
print(c)

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int,input().split()))
c=0
T=True
for i in a:
    if (i%2)!=0:
        print(c)
        break
    else:
        while T:
            a=list(map(lambda x:x/2,a))
            c+=1
            b=list(map(lambda x:True if x%2==0 else False,a))
            T=b[False]
        print(c)

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int,input().split()))
i=0
T=True
while T:
    a=list(map(lambda x: x/2,a))
    c=list(map(lambda x : True if x%2 ==0 else False,a))    
    for k in c:
        if k==False:
            T=False
            i-=1
    i+=1
print(i)

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int,input().split()))
i=0
T=True
while T:
    a=list(map(lambda x: int(x/2),a))
    i+=1
    c=list(map(lambda x : True if x%2 ==0 else False,a))    
    for k in c:
        if k==False:
            T=False
print(i)

Submission status: Runtime Error

Solution code:
a,b,c = map(str, input().split())
al = [a,b,c]
print(al.count("1"))

Submission status: Runtime Error

Solution code:
abc = map(int, input().split())
print(abc.count(1))

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
print(int(a) + int(b) + int(c))

Submission status: Runtime Error

Solution code:
import sys
N=int(input())
x=[int(i) for i in input().split()]
cnt=0
while(1):
    for i in range(N):
        if x[i]%2 != 0:
            print(cnt)
            sys.exit()
    tmp=[i//2 for i in x]
    x=tmp
    cnt+=1

Submission status: Runtime Error

Solution code:
a=str(input())
b=0
for moji in a:
    if moji=="1"
    b+=1

print(b)

Submission status: Runtime Error

Solution code:
n = int(input())
arr = [int(x) for x in input().split()]

def countTwoInFactor(n):
   def countTwoInFactori(n, acc):
      return countTwoInFactori(n / 2, acc + 1) if n % 2 == 0 else acc
   return countTwoInFactori(n, 0)

arr2 = [countTwoInFactor(x) for x in arr]
arr2.sort()
print(arr2[0])

Submission status: Runtime Error

Solution code:
import math

n = int(input())
arr = [int(x) for x in input().split()]

isAllEven = len([x for x in arr if x % 2 == 0]) == n

if not isAllEven:
   print(0)
   exit()

arr.sort()
print(math.log2(arr[0]))

Submission status: Runtime Error

Solution code:
import math

n = int(input())
arr = [int(x) for x in input().split()]

count = 0
max_even = 0
for x in arr:
   if x % == 2 and x > max_even:
      max_even = x 

print(math.log2(max_even))

Submission status: Runtime Error

Solution code:
N = input()
ans = 0
for x in N:
  if x == '1'
    ans += 1
  else:
    pass
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
a = list(map(int,input().split()))

c = list()

for n in range(N):
    for i in range(1,31):
        if not a[n]%(2**i)==0:
            c.append(i-1)
            break
print(min(c))

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
num = list(map(int, input().split()))
num = np.array(num)
count = 0
judge = 0

for i in range(N):
    if (num[i] % 2) == 1:
        judge = 1

while judge == 0:

    num = num/2
    count += 1

    for i in range(N):
        if (num[i] % 2) == 1:
            judge = 1

print(count)

Submission status: Runtime Error

Solution code:

def div(n):
    ans = 0
    while n % 2 == 0:
        n /= 2
        ans+=1
    return ans

N = int(input())
list = map(int,input().split())

ans = min(map(div,list))

print(ans)

Submission status: Runtime Error

Solution code:
li = input().split('')
print(len([a for a in li if a == '1']))

Submission status: Runtime Error

Solution code:
li = list(map(int, input.split('')))
print(len([a for a in li if a == 1]))

Submission status: Runtime Error

Solution code:
li = input.split('')
print(len([a for a in li if a == '1']))

Submission status: Runtime Error

Solution code:
n = int(input(), 2)
count  = 0
while n > 0:
    n = n && (n - 1)
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
num = input()
count = 0
for i in len(num):
  if (num[i] == '1'):
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
num = input()
count = 0
for i in len(num):
  if (num[i] == 1):
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
import math
n = input()
a = list(map(int, input().split()))
for i in a:
    ans = bin(i).find("1") - 1
print(round(ans))

Submission status: Runtime Error

Solution code:
import math
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    ans = bin(i).find("1") - 1
print(round(ans))

Submission status: Runtime Error

Solution code:
import math
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    ans = bin(i).rfind("1") - 1
print(round(ans))

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
A = list(map(int,input().split()))
A_unique = list(set(A))
N_unique = len(A_unique)

a = [A.count(A_unique[i]) for i in range(N_unique)]
a_sort = sorted(a)

M = N_unique-K
if M <= 0:
	print(0)
	exit()

ans = 0
for i in range(0,M):
	ans += a_sort[i]
print(ans)

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
A = list(map(int,input().split()))
A_unique = list(set(A))
N_unique = len(A_unique)

a_sort = sorted([A.count(A_unique[i]) for i in range(N_unique))])

M = A_unique-K
if M <= 0:
	print(0)
	exit()

ans = 0
for i in range(0,M):
	ans += a_sort[i]
print(ans)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
x=0
b=0
for i in range(n):
    b+=a[i]%2
while b==0 :
    x += 1
    for i in range(n):
        a[i]/=2
        b+=a[i]%2
print(x)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
x=0
b=0
for i in range(n):
    b+=a[i]%2
while b==0 :
    x += 1
    for i in range(n):
        a[i]/=2
        b+=a[i]%2
print(x)

Submission status: Runtime Error

Solution code:
import math
n = input()
a = list(map(int, input().split( )))
ans = float("inf")
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print(round(ans))

Submission status: Runtime Error

Solution code:
N=int(input())#入力回数を決める
data = input().split() 
list_count = []
for num in data:
    count = 0
    while int(num) % 2 == 0:
        num = int(num) / 2
        count += 1
    list_count.append(count) 

print(min(list_count))

Submission status: Runtime Error

Solution code:
N=int(input())
hoge=input()
count=0
hoge=hoge.split()
for i in range(N):
  hoge[i] = int(hoge[i])
while True:
  all_even=True
  for i in range(N):
    if hoge[i] % 2 != 0:
      all_even = False
  if all_even == False:
    break
  else:
    count += 1
    for i in range(N):
      hoge[i]=hoge[i]/2
print(count)

Submission status: Runtime Error

Solution code:
s = input(str())
print(s.text("1"))

Submission status: Runtime Error

Solution code:
input()
n=eval(input().replace(' ','|'))
print(len(bin(n&-n))-3)
#コピペです。

Submission status: Runtime Error

Solution code:
length = int(input())
a_list = map(int, input().split())

num_list = []
for a in a_list:
    t = a
    num = 0
    while t % 2 == 0:
        num += 1
        t = t / 2
    num_list.append(num)

print(min(num_list))
#こぴぺです。

Submission status: Runtime Error

Solution code:
y = list(input())
# y = [0,1,0]のようなリストになっているはず
x = 0
for i in range(0,2):
	if y[i] == 1:
      x += 1
    else:
      continue
print(x)

Submission status: Runtime Error

Solution code:
y = list(input())
# y = [0,1,0]のようなリストになっているはず
x = 0
for i in range(0,2):
	if y[i] == 1:
      x += 1
print(x)

Submission status: Runtime Error

Solution code:
y = list(input())
n = sum(y[i]=1 for i in y)
print(n)

Submission status: Runtime Error

Solution code:
#0が1をスペース区切りで3つ入力
a, b, c = map(int, input().split())

#aからcそれぞれが1と等しいかどうかを判断し、等しいのであれば順次iに1を足していく
i = 0

#aについて
if a==1:
    i += 1
    
#bについて
if b==1:
    i += 1    

#cについて
if c==1:
    i += 1
    
#出力
print(i)

Submission status: Runtime Error

Solution code:
s = map(int, list(raw_input())) #入力した時にリストでSを配列
print sum(s) #s[0]~s[N]までの合計を出す

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
a,b,c-map(str,input())
S = abc
print(S.count("1"))

Submission status: Runtime Error

Solution code:
s1,s2,s3 = map(int, input().split())
a = [s1,s2,s3]
n = len([i for i in a if i == 1])
print(n)

Submission status: Runtime Error

Solution code:
n = int(input())
count = 0
for i in range(len(n)):
  if n[i] == 1:
    count += 1
  else:
    count += 0
print(count)

Submission status: Runtime Error

Solution code:
from collections import Counter
n, k = map(int, input().split())
a = list(map(int, input().split()))

def cnt_uniq(li):
    return Counter(li).values()

uniq = sorted(cnt_uniq(a), reverse = True)[k:]
print(sum(uniq))

Submission status: Runtime Error

Solution code:
count = 0
for s in input():
    if s = '1':
        count += 1

print(count)

Submission status: Runtime Error

Solution code:
_ = int(input())
l = list(map(int, input().split()))

ans = 10 ** 9

for n in l:
    count = 0
    while n % 2 == 0:
        n //= 2
        count += 1
    ans = min(ans, count)

print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())

a = []
a = list(map(int, input().split()))

counter = 0
check = 0

for i in range(n):
    if a[i] % 2 = 0:
        check += 1



while check == n:
    for i in range(n):
        a[i] = a[i]/2
    for i in range(n):
        product = 1
        product *= a[i]
    counter += 1
print(counter)

Submission status: Runtime Error

Solution code:
dat=input()
print(dat.count('1')

Submission status: Runtime Error

Solution code:
dat=str(input().split())
print(dat.count('1')

Submission status: Runtime Error

Solution code:
input()
nums = input().split()
result = 18 # 制約 Ai < 10^9より
for num in nums:
  num = int(num)
  div_times = 0
  while (num & 1) == 0:
    num = num >> 1
    div_times += 1
  if div_times < result:
    result = div_times
print(result)

Submission status: Runtime Error

Solution code:
S = list(input())
print(s.count('1'))

Submission status: Runtime Error

Solution code:
def div_cnt(input_n):
    cnt = 0
    while input_n % 2 == 0:
        input_n /= 2
        cnt += 1

    return cnt

input_n = int(input())
input_a = list(map(int,input().split()))
cnt = min(map(div_cnt,input_a))

print(cnt)

Submission status: Runtime Error

Solution code:
import collections
N,K = map(int,input().split(" "))
A = list(map(int,input().split(" ")))
count = collections.Counter(A)
num = len(count)-K
a = sorted(count.values())
print(sum(a[:num]))

Submission status: Runtime Error

Solution code:
s = [int(x) for x in int(input())]

sum = 0
for i in s:
  if i == 1:
    sum += 1

print(sum)

Submission status: Runtime Error

Solution code:
N=int(input())
List=list(map(int,input().split()))
Flag=0
Counter=-1
Element=0
while Flag<1:
  while Element<N:
      if List[Element]%2==1:
        Flag=1
      List[Element]=List[Element]/2
      Element+=1
  Element=0
  Counter+=1
print(Counter)

Submission status: Runtime Error

Solution code:
#include <iostream>

using namespace std;

int main(){
    
    int a;
    
    cin >> a;
    
    int sum=0,i;
    
    while(a!=0){
        i=a%10;
        sum+=i;
        a/=10;
    }
    
    cout << sum;
    
    return 0;
}

Submission status: Runtime Error

Solution code:
print(eval(input()+'%9'))

Submission status: Runtime Error

Solution code:
N=int(input())
a=list(map(int,input().split()))

n=0
flag = 1

while flag:
	for i in range(len(a)):
		if a[i]%2==0:
			a[i]=a[i]//2
		else:
			flag = 0
	n=n+1

print(n-1)

Submission status: Runtime Error

Solution code:
N=int(input())
a=list(map(int,input().split()))
n=0
flag = 1

while flag:
	for i in range(len(a)):
		if a[i]%2==0:
			a[i]=a[i]/2
		else:
			flag = 0
	n=n+1

print(n-1)

Submission status: Runtime Error

Solution code:
i=input()
print(count('1'))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Nov  3 09:19:07 2018

@author: sk
"""

     
      
a, b, c = map(int, input().split())

int s=0

if a==1:
  s=s+1

if b==1:
  s=s+1

if c==1:
  s=s+1
  

print(s)

Submission status: Runtime Error

Solution code:

(sandbox) C:\Dev\python_scripts>

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
a=str(a)
b=str(b)
c=str(c)
d=a.find("1")
e=b.find("1")
f=c.find("1")
if d+e+f=-3:
  print("0")
elif d+e+f=-2:
  print("1")
elif d+e+f=-1:
  print("2")
elif d+e+f=0:
  print("3")

Submission status: Runtime Error

Solution code:
A = input()
print(int(A[0])+int(A[1]+int(A[2]))

Submission status: Runtime Error

Solution code:
s = list(map(int, input().split()))
ans = 0
for i in range(3):
    if s[i] == 1:
        ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
import re
a = input()
print(len(re.match("1",a)))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a = input()
print(len(re.match("1",a)))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a = input()
print len(re.match("1",a))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
print(sum(list(map(int, list(a)))))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a = input()
print re.match("1",a)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a = input()
print re.match("1",s)

Submission status: Runtime Error

Solution code:
n = int(input())
a = []

for i in range(n):
    a.append(int(input()))

count = 0

while(True):
    odd = False
    for i in range(n):
        if((a[i] % 2) != 0):
            odd = True
    if(odd):
        break
    for i in range(n):
        a[i] /= 2 
    count += 1


print(count)

Submission status: Runtime Error

Solution code:
s = input()
c = 0
if(s[0] == "1"):
    c++


if(s[1] == "1"):
    c++


if(s[2] == "1"):
    c++

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
A=list(map(int,input().strip().split(" ")))
ANS=[]
for i in range(100000):
    ANS.append(A.count(i))
ANS.sort(reverse=True)
B=[e for e in ANS if e>0]

P=[]
if len(B)<=k:
    print(0)
else:
    for i in B[k:]:
        P.append(i)
    print(sum(P))

Submission status: Runtime Error

Solution code:
mas = [int(i) for i in input().split()]

count = 0

for j in len(mas):
  if mas[j] == 1:
    count += 1

print(count)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=float("inf")
for i in a:
    i=bin(i).count("0")
    if ans > i :
        ans=i
print(ans)

Submission status: Runtime Error

Solution code:
a = list(str(input()))
print(s.count("1"))

Submission status: Runtime Error

Solution code:
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1")-1)
print(ans)

Submission status: Runtime Error

Solution code:
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    ans = min(ans, len(a) - bin(a).rfind("1")-1)
print(ans)

Submission status: Runtime Error

Solution code:
print(input.count("1"))

Submission status: Runtime Error

Solution code:
s = input()

cnt = 0
for c in s:
	if c == "1":
		cnt += 1
print(cmt)

Submission status: Runtime Error

Solution code:
N,K=map(int,input().split())
A=list(map(int,input().split()))
L=[]
A.sort()
A.append(200001)
for i in range(N):
  if A[i]==A[i+1]:
    continue
  else:
    x=A.count(A[i])
    L.append(x)
L.sort(reverse=True)
S=0
for i in range(K):
  S+=L[i]
print(N-S)

Submission status: Runtime Error

Solution code:
s = input()
print(s.count("1!)

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))
flag=0

for x in range(100):
  for y in range(N):
    if  A[y]%2==0:
      A[y]=A[y]/2    
    else:
      print(x)
      flag=1
      break
  if flag==1:
    break

Submission status: Runtime Error

Solution code:
s = input()
for i in s:
  if i == '1':
    c += i
print(c)

Submission status: Runtime Error

Solution code:
a= list(map(int,input().split("0")))
print(sum(a))

Submission status: Runtime Error

Solution code:
print(sum(list(int(input()))))

Submission status: Runtime Error

Solution code:
print(sum(list(input())))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<n;i++)
#define IREP(i,n) for(ll i=1;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define DEBUG(x) cerr << x << "\n"

int main(){
    string s;
    cin >> s;
    cout << count(s.begin(),s.end(),'1');
    return 0;
}

Submission status: Runtime Error

Solution code:
import math
N = input()

a = list(map(int, input().split()))

ans = float("inf")

for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print(round(ans))

Submission status: Runtime Error

Solution code:
import math
N = input()

list = list(map(int, input().split()))

ans = float("inf")

for a in list:
    ans = min(ans, len(bin(a)) - bin(a).rfind("1") - 1)
print(round(ans))

Submission status: Runtime Error

Solution code:
N = input()

list = list(map(int, input().split()))

ans = float("inf")

for a in list:
    ans = min(ans, len(bin(a)) - bin(a).rfind("1") - 1)
print(round(ans))

Submission status: Runtime Error

Solution code:
N = input()

list = list(map(int, input().split()))

ans = float("inf")

for a in list:
    ans = min(ans, len(bin(a)) - bin(a).rfind("1") - 1)
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
list = input().split()

num_list = []
for c in list:
    n = int(c)
    num_list.append(n)

state = True

i = 0

while state:
    for n in num_list:
        if n % 2:
            state = False
        else:
            n /= 2
    if state:
        i += 1

print(i)

Submission status: Runtime Error

Solution code:
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    ans = min(ans, len(bin(i) - bin(i).rfind("1") - 1)
print(round(ans))

Submission status: Runtime Error

Solution code:
import collections
N,K=map(int,input().split())
c=sorted(collections.Counter(list(map(str,input().split()))).values())
print(sum(c[:-K]))

Submission status: Runtime Error

Solution code:
N=int(input())
l=list(map(int, input().split()))

n=0
def power(figure):
    if figure%2==0:
        return True
    else:
        return False

while len(list(filter(power,l)))==N:
    n+=1
    k=map(lambda x: x/2,l)
    l=list(k)


print(n)