atcoder#TENKA12017A. Accepted...?
Accepted...?
Score : points
Problem Statement
Snuke prepared problems for a upcoming programming contest. For each of those problems, Rng judged whether it can be used in the contest or not.
You are given a string of length .
If the -th character of is 1
, it means that the -th problem prepared by Snuke is accepted to be used; 0
means that the problem is not accepted.
How many problems prepared by Snuke are accepted to be used in the contest?
Constraints
- The length of is .
- consists of
0
and1
.
Inputs
Input is given from Standard Input in the following format:
Outputs
Print the number of problems prepared by Snuke that are accepted to be used in the contest.
111100
4
The first, second, third and fourth problems are accepted, for a total of four.
001001
2
000000
0