//UVA699TheFallingLeaves
#include<cstdio>
#include<cstring>
#include<cstdlib>
const int MAXN = 200;
int a[MAXN];
void build(int po) {
int v = 0;
scanf("%d", &v);
if(v == -1) return ;
a[po] += v;
build(po - 1); build(po + 1);
}
bool initial() {
memset(a, 0, sizeof(a));
int v;
scanf("%d", &v);
if(v == -1) return false;
int root = MAXN / 2;
a[root] = v;
build(root - 1); build(root + 1);
return true;
}
int main() {
int kase = 0;
while((initial())) {
int p = 0;
while(a[p] == 0) p++;
//if(kase) printf("\n");
printf("Case %d:\n%d", ++kase, a[p++]);
while(a[p] != 0) printf(" %d", a[p++]);
printf("\n\n");
}
return 0;
}
UVA699TheFallingLeaves
最新推荐文章于 2019-03-26 22:46:10 发布