#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5;
int sum[maxn];
void build(int p){
int v;
scanf("%d",&v);
if(v==-1)return;
sum[p]+=v;
build(p-1);
build(p+1);
}
int init(){
int v;
scanf("%d",&v);
if(v==-1)return 0;
memset(sum,0,sizeof(sum));
int pos=maxn/2;
sum[pos]=v;
build(pos-1);
build(pos+1);
}
int main(){
int t=0;
while(init()){
int p=0;
while(sum[p]==0)p++;
printf("Case %d:\n%d",++t,sum[p++]);
while(sum[p])printf(" %d",sum[p++]);
printf("\n\n");
}
return 0;
}
UVA 699 The Falling Leaves
最新推荐文章于 2020-02-24 12:45:19 发布