20180301---跳跳棋

#include <iostream>
using namespace std;



int main()
{
	int n[30];
	int i = 0;
	int num;
	int flag = 0;
	int sum = 0;
	while (flag == 0)
	{
		cin >> num;
		n[i] = num;
		i++;
		if (num == 0)
			flag = 1;
	}
	for (int j = 0;j < i;j++)
	{
		if (n[j] == 1)
		{
			sum += 1;
		}
		else if (n[j] == 2)
		{
			if (n[j - 1] == 1 || j == 0)
			{
				sum += 2;
			}
			else
			{
				int k = 1;
				for (int m = j-1;m > 0;m--)
				{
					if (n[m] == 2)
						k++;
					else
						break;
				}
				sum += k * 2;
			}
		}
		else if (n[j] == 0)
		{
			break;
		}
	}
	cout << sum;

}