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: Accepted

Solution code:
text = input()
count = 0
for c in text:
    if c == "1":
        count += 1
print(count)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

s=input()

count =0
for value in s:
    if value == "1":
        count+=1
    else:
        continue

print(count)

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

S = s()
total = 0
for c in S:
    if c == '1':
        total += 1
print(total)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
count = 0
for i in a:
    if int(i) == 1:
        count += 1
print(count)

Submission status: Accepted

Solution code:
a = input()

count = 0
for i in a:
	if (i == '1'):
		count+=1
print(count)

Submission status: Accepted

Solution code:
S = input()

c = 0
for s in S:
    if s == '1':
        c += 1
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print(input().count("1"))

Submission status: Accepted

Solution code:
a = str(input())
count = 0
for i in a:
    count += int(i)
print(count)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3



# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    # Failed to predict input format
    pass

if __name__ == '__main__':
    print(input().count("1"))
    main()

Submission status: Accepted

Solution code:
INPUT = list(map(int, list(input())))

cnt = 0
for i in INPUT:
    if i == 1:
        cnt = cnt + 1

print("{}".format(cnt))

Submission status: Accepted

Solution code:
s = (input())
p = [int(c) for c in s]
k = 0
for i in range(3):
  if p[i] == 1:
    k = k + 1
print(k)

Submission status: Accepted

Solution code:
def main():
    s = list(input())
    count = 0
    if(s[0] == '1'):
        count += 1
    if(s[1] == '1'):
        count += 1
    if(s[2] == '1'):
        count += 1
    
    print(count)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
num = input()
a = (num[0])
b = (num[1])
c = (num[2])

count = 0

if int(a) == 1:
    count += 1
if int(b) == 1:
    count += 1
if int(c) == 1:
    count += 1

print(count)

Submission status: Accepted

Solution code:
def main():
    inputs = input()
    score = sum([1 for s in inputs if s == "1"])
    print(score)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    s = input()
    print(s.count('1'))

Submission status: Accepted

Solution code:
a = str(input())
s = 0
for i in range(0, 3):
    if a[i] == '1':
        s += 1
print(s)

Submission status: Accepted

Solution code:
a, b, c = input()
a, b, c = map(int, [a, b, c])
print(len([s for s in [a, b, c] if s == 1]))

Submission status: Accepted

Solution code:
s=input()
c=0
for i in range(len(s)):
    c += int(s[i])
print(c)

Submission status: Accepted

Solution code:
a=str(input())
s=0
for i in range(0,3):
    if a[i]=="1":
        s+=1
print(s)

Submission status: Accepted

Solution code:
from collections import Counter

s = input()
s = list(s)

S = Counter(s)
print(S["1"])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
input_str = input()
counter = 0
for i in range(len(input_str)):
    if input_str[i] == '1':
        counter = counter + 1
print(counter)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
#一文字ずつ区切る
chars = list(input())
#文字列で入っているぽい['1', '0', '1']
#文字列１とあっている配列の数をとりだしている
print(chars.count('1'))

Submission status: Accepted

Solution code:
a = list(input())
c = a.count('1')

print(int(c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
score =0

for i in a:
  if i != "0":
    score += 1
    
  if i == "0":
    pass

print(score)

Submission status: Accepted

Solution code:
x=int(input())
a=x//100
b=(x-(x//100)*100)//10
c=x%10
print(a+b+c)

Submission status: Accepted

Solution code:
# coding: utf-8
list = int(input())

count = 0
while list > 0:
    if list%10 == 1:
        count+=1
    list = int(list / 10)

print(count)

Submission status: Accepted

Solution code:
s = input()

cnt = s.count("1")
print(cnt)

Submission status: Accepted

Solution code:
a,b,c=str(input())
print(int(a)+int(b)+int(c))

Submission status: Accepted

Solution code:
inp = input()

masu = list(inp)
count = 0
for i in range(len(masu)):
    if int(masu[i]) == 1:
        count = count + 1

print(count)

Submission status: Accepted

Solution code:
s1,s2,s3 = map(int, input())
masu = []
masu.append(s1)
masu.append(s2)
masu.append(s3)
print(masu.count(1))

Submission status: Accepted

Solution code:
lst = [int(x) for x in list(input())]
print(sum(lst))

Submission status: Accepted

Solution code:
s=list(map(int,input()))
print(s[0]+s[1]+s[2])

Submission status: Accepted

Solution code:
ans = str(input())
print(ans.count("1"))

Submission status: Accepted

Solution code:
import re # 正規表現

def i_input(): return int(input())
def s_input(): return map(int,input().split())
def l_input(): return list(map(int, input().split()))
# 文字列のまま受け取りたいときはinput()

s = input()
print(len(re.findall('1', s)))

Submission status: Accepted

Solution code:
a,b,c = map(int,input())
d = 0
if(a == 1):
    d = d +1

if(b == 1):
    d = d +1
    
if(c == 1):
    d = d +1
print(d)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

print(input().count('1'))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = list(input())

print (A.count('1'))

Submission status: Accepted

Solution code:
strings = input()
cnt = 0
for i in strings:
    if i == "1":
        cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
ans = 0
for i in range(3):
    ans += int(S[i])
print(ans)

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial
from heapq import heappop, heappush, heappushpop
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    s = ST()
    print(s.count("1"))
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

print(S.count("1"))

Submission status: Accepted

Solution code:
s = str(input())
ans = 0
for i in s:
    if i == "1":
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
from collections import defaultdict

def check(a, pre):
    ans = 0
    while a % 2 == 0:
        ans += 1
        a //= 2
        if ans == pre:
            break
    return ans


def main():
    # num = int(input())
    data = input()
    print(data.count('1'))



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
ls = list(input())
c = ls.count('1')
print(c)

Submission status: Accepted

Solution code:
s = input()
count = 0
for ss in s:
    if ss == "1":
        count += 1
print(count)

Submission status: Accepted

Solution code:

lst_a = list(input())
ans = 0
for i in range(3):

    if lst_a[i] == "1":
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
s = input()
count = 0


if s[0] == '1':
  count += 1
  
if s[1] == '1':
  count += 1
  
if s[2] == '1':
  count += 1
  
print(count)

Submission status: Accepted

Solution code:
a = int(input())
print(a % 9)

Submission status: Accepted

Solution code:
n = int(input())

count = 0
if int(n / 100) == 1:
    count += 1
    n = n % 100
else:
    pass

if int(n / 10) == 1:
    count += 1
    n = n % 10
else:
    pass

if n == 1:
    count += 1
else:
    pass

print(count)

Submission status: Accepted

Solution code:
s = input().split()
count = 0

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

Submission status: Accepted

Solution code:
n = input()
result = 0
if n[0] == '1':
  result += 1
if n[1] == '1':
  result += 1
if n[2] == '1':
  result += 1
print(result)

Submission status: Accepted

Solution code:
n = input()
print(sum([int(i) for i in n]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(sum([i=="1" for i in input()]))

Submission status: Accepted

Solution code:
a = list(input())
ans = 0
for x in a:
    ans += int(x)

print(ans)

Submission status: Accepted

Solution code:
n=input()
c=0
if n[0]=="1":
    c+=1
if n[1]=="1":
    c+=1
if n[2]=="1":
    c+=1
print(c)

Submission status: Accepted

Solution code:
S = str(input())

count = 0
if S[0] == '1':
    count += 1
if S[1] == '1':
    count += 1
if S[2] == '1':
    count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()

x=x.count("1")

print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = input()
count = 0
for i in range(3):
	if a[i] == str(1):
		count += 1
	else:
		pass
print(count)

Submission status: Accepted

Solution code:
s=input()
ans=0
for i in range(len(s)):
    if s[i]=="1":
        ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = input()

l = 0
for t in range(len(k)):
    if k[t] == '1':
        l += 1
print(l)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(sum(map(int, input().strip())))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
s1, s2, s3 = input()
# 出力
print("{}".format(int(s1)+int(s2)+int(s3)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list = input()
count = 0
for x in list:
    if x == "1":
        count += 1
print (count)

Submission status: Accepted

Solution code:
a = input()

sum = 0
for s in a :
    sum += int(s) 

print(sum)

Submission status: Accepted

Solution code:
inputStr = input()
score = 0
for i in range(len(inputStr)):
    if inputStr[i:i+1] == "1":
        score +=1
print(score)

Submission status: Accepted

Solution code:
li = list(map(int,list((input()))))
print(li.count(1))

Submission status: Accepted

Solution code:
a = input()
a = int(a)
if a==111:
  print("3")
elif a==101 or a==110 or a==11:
  print("2")
elif a ==0:
  print("0")
else:
  print("1")

Submission status: Accepted

Solution code:
# sys.stdin.readline()
import sys
import math
input = sys.stdin.readline

s = input()
print(s.count('1'))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
result =0
for i in S:
    if i == str(1):
        result += 1
print(result)

Submission status: Accepted

Solution code:
from sys import stdin

list = stdin.readline().rstrip()

result = 0
for i in range(0, 3):
    if(list[i]=='1'):
        result += 1

print(result)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    line = str(input())
    count = 0
    if line[0] == '1':
        count += 1
    if line[1] == '1':
        count += 1
    if line[2] == '1':
        count += 1
    print(count)

Submission status: Accepted

Solution code:
str1 = input()
sum1 = int(str1[0]) +  int(str1[1]) + int(str1[2]) 
print(str(sum1))

Submission status: Accepted

Solution code:
x = list(input())
cnt = 0
for i in range(3):
    if(x[i] == '1'):
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
s=str(input())
ans=0
for i in s:
  if i=="1":
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc081/tasks/abc081_a

n = input()
print(sum(list(map(int, str(n)))))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#問題文
#すぬけ君は 1,2,3 の番号がついた 3 つのマスからなるマス目を持っています。 各マスには 0 か 1 が書かれており、マス i
# には si が書かれています。
#すぬけ君は 1 が書かれたマスにビー玉を置きます。 ビー玉が置かれるマスがいくつあるか求めてください。

#制約
#s1,s2,s3 は 1 あるいは 0

countup = 0
s = str(raw_input())
for count in s :
    if count == '1':
        countup += 1
    else:
        countup = countup

print countup

Submission status: Accepted

Solution code:
s=list(input())
ans=0
for i in s:
  if i=="1":
    ans=ans+1
print(ans)

Submission status: Accepted

Solution code:
# coding:UTF-8

grid_info = input()

# ビー玉の数
marble_count = 0

for i in range(len(grid_info)):
  if grid_info[i] == '1':
    marble_count += 1
    
print(marble_count)

Submission status: Accepted

Solution code:
print(str(sum([int(i) for i in input()])))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d = input()
c = 0
for i in list(range(0,3)):
  if d[i]=='1':
    c = c + 1

print("{}".format(c))

Submission status: Accepted

Solution code:
a = list(input())

res = 0
for i in range(len(a)):
  res = res + int(a[i])

print(res)

Submission status: Accepted

Solution code:
allnum = str(input())
x = 0
for i in range(3):
    
  if allnum[i] == "1":
    x = x+1
  else:
    x = x

print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
def main():
    s = input()

    counter = 0
    for si in s:
        counter = counter + int(si)

    print(counter)

main()

Submission status: Accepted

Solution code:
N = input()
cnt = 0
for n in N:
  if n == "1":
    cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
row = int(input())

a1 = row // 100
a2 = (row - a1 * 100) // 10
a3 = (row - a1 * 100 - a2 * 10)

print(a1 + a2 + a3)

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]
    a = input()

    print(a.count('1'))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

s = input()
ans = 0

for i in range(len(s)):
    if s[i] == '1':
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    s = str(input())

    print(s.count('1'))

Submission status: Accepted

Solution code:
from sys import stdin

c = 0
for s in stdin.readline().rstrip():
    if int(s) == 1:
        c = c + 1

print(c)

Submission status: Accepted

Solution code:
s = input()
a = [int(i) for i in s]
b = []
for x in range(len(a)):
    if a[x] == 1:
        b.append(1)
print(len(b))

Submission status: Accepted

Solution code:
answer = 0
for c in input():
  if c == "1":
    answer += 1
print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(sum(list(map(lambda x:int(x),list(input().strip())))))

Submission status: Accepted

Solution code:
s = input()
cnt = 0
for i in range(len(s)):
    if s[i]=="1":
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
s=input()

print(s.count("1"))

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    s = stdin.readline().rstrip()
    print(len([x for x in s if x == '1']))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    print(input().count('1'))


main()

Submission status: Accepted

Solution code:
#ABC_081A(全探索)
# -*- coding: utf-8 -*-
# 文字列の入力
s = input()
#1のカウント
cnt = 0
for i in range(3):
  if s[i] == '1':
    cnt += 1
# 出力
print(cnt)

Submission status: Accepted

Solution code:
s = int(input())
s1 = s//100
s2 = s%100//10
s3 = s%100%10

count = 0

if s1 == 1:
  count = count +1
  
if s2 == 1:
  count = count +1

if s3 == 1:
  count = count +1

print(count)

Submission status: Accepted

Solution code:
s=input()
count = 0
if s[0] == "1":
    count = count + 1
if s[1] == "1":
    count = count + 1
if s[2] == "1":
    count = count + 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


a = str(input())
print(int(a[0])+int(a[1])+int(a[2]))

Submission status: Accepted

Solution code:
a = input()

snum = 0
if a[0] == '1':
  snum += 1
if a[1] == '1':
  snum += 1
if a[2] == '1':
  snum +=1

print(snum)

Submission status: Accepted

Solution code:
s = input()
a = [int(c) for c in s]
count = 0
if(a[0] == 1):
  count += 1
if(a[1] == 1):
  count += 1
if(a[2] == 1):
  count += 1
print(count)

Submission status: Accepted

Solution code:
marble_place = input()

marble = 0
for character in marble_place:
    if character == '1':
        marble += 1
        
print(marble)

Submission status: Accepted

Solution code:
S = list(input())
ans = 0
for i in range(3):
  if S[i] == '1':
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
s = list(input())
ans = 0
for i in range(3):
  if s[i] == '1':
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()
char_list = list(str)
#print(char_list)
count=int(char_list[0])+int(char_list[1])+int(char_list[2])
print(count)

Submission status: Accepted

Solution code:
li = list(input())
c = 0
for i in [0,1,2]:
  if li[i]=='1':
    c = c +1
    
print(c)

Submission status: Accepted

Solution code:
s = input();
s1 = s[0];
s2 = s[1];
s3 = s[2];
r = 0;
if (s1 == '1'):
    r += 1
if (s2 == '1'):
    r += 1
if (s3 == '1'):
    r += 1
print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(str(input()))
ans = 0
for s in S:
  if s == '1':
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string = input()
counter = 0
if(string[0] == '1'):
    counter += 1
if(string[1] == '1'):
    counter += 1
if(string[2] == '1'):
    counter += 1
print(counter)

Submission status: Accepted

Solution code:
[a, b, c] = (int(i) for i in list(input()))

counter = 0
for i in [a, b, c]:
    if i == 1:
        counter += 1
        
print(counter)

Submission status: Accepted

Solution code:
s1, s2, s3 = map(int, input())
A = list([s1, s2, s3])
print(A.count(1))

Submission status: Accepted

Solution code:
s = raw_input()
a = -1
b = 0
for i in range(3):
    a = a + 1
    if s[a] == "1":
        b = b + 1
print b

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    s = input()
    ans = 0
    for i in s:
        if i == '1':
            ans += 1
    
    print(ans)

solve()

Submission status: Accepted

Solution code:
inp = input()

print(len(["A" for x in list(inp) if x == "1"]))

Submission status: Accepted

Solution code:
a = input()
cnt = 0
for i in a:
  if i == '1':
    cnt+=1
    
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
li = list(S)
 
ans = 0
for i in range(3):
  if li[i] == "1":
    ans += 1
print(ans)

Submission status: Accepted

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

if s[1] == "1":
    t += 1

if s[2] == "1":
    t += 1

print(t)

Submission status: Accepted

Solution code:
test =input()
cnt =0
for r in range(len(test)):
    s = int(test[r])
    if (s%2 == 1):
        cnt +=1

print(cnt)

Submission status: Accepted

Solution code:

def read_input():
    s = input()
    d = [int(c) for c in s]
    return d

def submit():
    d = read_input()
    print(sum(d))

if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
#
# abc081 a
#
a = input()
ret = 0
for i in range(3):
    if a[i] == '1':
        ret += 1
print(ret)

Submission status: Accepted

Solution code:
S = int(input())
count=0

if S//100==1:
    count +=1
S=S%100
if S//10==1:
    count +=1
if S%10==1:
    count +=1

print(count)

Submission status: Accepted

Solution code:
a=input()
print('3' if  a.count('1')==3 else '2' if a.count('1')==2 else '1' if a.count('1')==1 else '0')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = str(input())
_num = list(str(num))

print(_num.count("1"))

Submission status: Accepted

Solution code:
s = input()
s1 = int(s[0])
s2 = int(s[1])
s3 = int(s[2])

print(s1 + s2+s3)

Submission status: Accepted

Solution code:
a = str(input())
ans = 0
for i in range(3):
    if a[i] == "1":
        ans = ans + 1
print(ans)

Submission status: Accepted

Solution code:
a = str(input())
ans = 0
if a[0] == "1":
    ans = ans + 1

if a[1] == "1":
    ans = ans + 1

if a[2] == "1":
    ans = ans + 1

print(ans)

Submission status: Accepted

Solution code:
s=list(input())
s = [int(i) for i in s]
print(s.count(1))

Submission status: Accepted

Solution code:
temp=input()
cnt=0
for i in temp:
  if i=='1':
    cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
a = str(input())
b = 0
for i in range(len(a)):
    if a[i] == "0":
        b += 0
    else:
        b += 1
print(b)

Submission status: Accepted

Solution code:
sentence = input()
count = 0
for i in range(len(sentence)):
    if sentence[i] == "1":
        count+=1

print(count)

Submission status: Accepted

Solution code:
# /usr/bin/python
# -*- coding: utf-8 -*-
import sys
import math



Sn = list(str(input()))

print(Sn.count("1"))

Submission status: Accepted

Solution code:
s = [i for i in input()]
print(s.count('1'))

Submission status: Accepted

Solution code:
data = input()

print(data.count('1'))

Submission status: Accepted

Solution code:
import numpy as np

s1s2s3=int(input())

count1 = 0

num = []

while s1s2s3 != 0:
    num.append(s1s2s3 % 10)
    s1s2s3 //= 10
num.reverse()

for i in range (len(num)):
    if  num[i-1] == 1:
        count1 = count1 + 1
    else:
        pass

print(count1)

Submission status: Accepted

Solution code:
s = input()

count = 0
for s_i in s:
	if s_i == "1":
		count += 1

print(count)

Submission status: Accepted

Solution code:
s = list(input())

def check1(s):
	index,count = (0,0)
	while index < len(s):
		if s[index] == '1':
			count += 1
		index += 1 
	print(count)

check1(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = 0

for i in str(input()):
    if i == '1':
        n += 1

print(n)

Submission status: Accepted

Solution code:
import sys

def main():
    S = input()
    print(counter(S))

def counter(S):
    count = 0
    for s in S:
        if s=='1': count += 1
    return count

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = []
counter = 0
s =  list(str(input()).zfill(3))
for i in range(3):
  if s[i] == '1':
    counter += 1

print(counter)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

s = input()
ans = 0

for i in s:
    if int(i) == 1:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
S = input()

ans = 0
for s in S:
    if s == '1':
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
s1,s2,s3 = map(int,input())
s=[s1,s2,s3]
print(s.count(1))

Submission status: Accepted

Solution code:
s1,s2,s3=map(int,input())

s_=[s1,s2,s3]

s=s_.count(1)

print(s)

Submission status: Accepted

Solution code:
import collections
def marble(i):
    return collections.Counter(list(i))['1']

if __name__ == '__main__':
    marble_str = input()
    print(marble(marble_str))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a = input()

    print(a.count('1'))

main()

Submission status: Accepted

Solution code:
str_list = input()
count = 0
if str_list[0] == '1':
  count = count + 1
if str_list[1] == '1':
  count = count + 1
if str_list[2] == '1':
  count = count + 1
print(count)

Submission status: Accepted

Solution code:
str = input()
t = 0
 
for s in str:
  t = t + int(s)
  
print(t)

Submission status: Accepted

Solution code:
str = input()

a = int(str[0])
b = int(str[1])
c = int(str[2])

print(a+b+c)

Submission status: Accepted

Solution code:
n = input()
cun = 0
for i in n:
    if i == '1':
        cun += 1
print(cun)

Submission status: Accepted

Solution code:
#-*- coding:utf-8 -*-

a,b,c = (int(x) for x in input())
list = [a, b, c]
count = 0
for i in list:
	if i == 1:
		count += 1
print(count)

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper
print(input().count('1'))

Submission status: Accepted

Solution code:
s = input()
i = 0
for j in range(len(s)):
    if s[j] == '1': i += 1

print(i)

Submission status: Accepted

Solution code:
s = input()
if len(s) != 3:
	print('length')
	exit()

s_list = list(s)

for x in s_list:
	if int(x) < 0 or int(x) > 1:
		exit()

marble = 0
for x in s_list:
	if int(x) == 1:
		marble += 1

print(marble)

Submission status: Accepted

Solution code:
x = input()

if "1" in x:
    print(x.count("1"))
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s = list(input())
count = 0

for i in range(3):
    if s[i] == "1":
        count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

res = 0
for i in range(3):
    if S[i]== '1':
        res += 1
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
ans = int(S.count("1"))
print(ans)

Submission status: Accepted

Solution code:
# ABC081A - Placing Marbles
print(input().count('1'))

Submission status: Accepted

Solution code:
a=input()
c=0
for i in range(3):
  if a[i]=="1":
    c+=1
print(c)

Submission status: Accepted

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

if s[1]=="1":
    ans +=1

if s[2]=="1":
    ans += 1

print(ans)

Submission status: Accepted

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

if s[2]=="1":
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
s=input()
output=0

s_list=list(s)

if(s[0]=='1'):
    output+=1
if(s[1]=='1'):
    output+=1
if(s[2]=='1'):
    output+=1

print(output)

Submission status: Accepted

Solution code:

# ABC-081_A-Placing Marbles

in_list = list(input())
count = 0
# print("in_list:",in_list)
 
for string in in_list:
    if int(string)== 1:
        count += 1
print(count)

Submission status: Accepted

Solution code:
a = list(input())
cnt = 0

for i in a:
    if i == "1":
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
num = list(input())

count = 0
for i in num:
  if i == '1':
    count += 1
print(count)

Submission status: Accepted

Solution code:
print(len(input().replace("0", "")))