下落的树叶UVa 699

//#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
#include <map>
#include <set>
#include <sstream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <queue>
#include <iomanip>
#include <cmath>
using namespace std;

const int maxn = 10000 + 10;
int sum[maxn];
void build(int p)
{
	int v;
	cin >> v;
	if(v == -1) return;
	sum[p] += v;
	build(p-1);
	build(p+1);
}
bool init()
{
	int v;
	cin >> v;
	if(v == -1) return false;
	memset(sum, 0, sizeof(sum));
	int pos = maxn/2;
	sum[pos] = v;
	build(pos - 1); 
	build(pos + 1);
	return true;
}

int main() 
{
	int kase = 0;
	while(init())
	{
		int p = 0;
		while(sum[p] == 0) p++;
		cout<<"Case "<< ++kase << ":\n" << sum[p++];
		while(sum[p] != 0)
			cout << " " << sum[p++];
		cout << "\n\n";
	}
}