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.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)


import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		//宣言文
		//標準入力オブジェクトを生成
		Scanner sc = new Scanner(System.in);
		//標準入力で以下の変数を初期化
		int[] numArray = new int[3];
		numArray[0] = sc.nextInt();
		numArray[1] = sc.nextInt();
		numArray[2] = sc.nextInt();
		//フラグ変数
		boolean numFlag = true;
		int countNum = 0;

		//処理文
		for (int i = 0; i < numArray.length; i++) {
			if (!(numArray[i] == 0 || numArray[i] == 1)) {
				//制約 配列の中身が０か１なのか判定
				numFlag = false;
				break;
			}else if(numArray[i] == 1){
				//1をカウントする。
				countNum++;
			}

		}

		if(numFlag) {
			//標準出力
			System.out.print(countNum);
		}
	}
}