u699The Falling Leaves

#include <fstream>
#include <iostream>
#include <string>
#include <cstring>
#include <complex>
#include <math.h>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stdio.h>
#include <stack>
#include <algorithm>
#include <list>
#include <ctime>
#include <ctime>
#include <assert.h>

#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define eps 1e-8
#define M_PI 3.141592653589793

typedef long long ll;
const ll mod=1000000007;
const int inf=0x7fffffff;
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
using namespace std;
const int maxn=1010;
int sum[maxn];
void bulid(int pos)
{
   int v;cin>>v;
   if(v==-1) return;
   sum[pos]+=v;
   bulid(pos-1);bulid(pos+1);
}
bool init()
{
    int v;cin>>v;
    if(v==-1) return false;
    memset(sum,0,sizeof(sum));
    int pos=maxn/2;
    sum[pos]=v;
    bulid(pos-1);bulid(pos+1);
    return true;
}

int main()
{
    int ok,t=0,o=0;
    ios::sync_with_stdio(false);
    while(init()){
        printf("Case %d:
",++t);
        ok=1;
        for(int i=0;i<maxn;i++){
            if(sum[i]>0) {
                if(ok) ok=0;
                else printf(" ");
                printf("%d",sum[i]);
            }
        }
        printf("

");
    }
}