UVA699 - The Falling Leaves

简单递归的题目

#include<iostream>
#include<cstring>
using namespace std;
const int maxn=200;
int num[maxn],u=0;

void build(int dig){
    int v;
    cin>>v;
    if(v==-1) return;
    num[dig]+=v;
    build(dig-1);
    build(dig+1);
}

bool input(){
    int v;
    cin>>v;
    if(v==-1) return false;
    memset(num,0,sizeof(num));
    int dig=(maxn>>1);
    num[dig]+=v;
    build(dig-1);
    build(dig+1);
    return true;
}

int main(){
    ios::sync_with_stdio(false);
    while(input()){
        int p=0;
        while(!num[p]) p++;
        cout<<"Case "<< ++u <<":\n"<<num[p++];
        while(num[p]) cout<<" "<<num[p++];
        cout<<"\n\n";
    }
    return 0;
}