HRECURS - Hello Recursion (spoj).cpp

#include<bits/stdc++.h>
#define speed ios_base::sync_with_stdio(false)
#define boost cin.tie(NULL)
#define booster cout.tie(NULL)
#define endl "\n"
typedef long long int lld;

#define F(a,n) for(int i=0;i<n;i++){cin>>a[i];}
#define F1(a,n) for(int i=1;i<=n;i++){cin>>a[i];}
#define P(a,n) for(int i=0;i<n;i++){cout<<a[i]<<' ';}cout<<endl;
#define P1(a,n) for(int i=1;i<=n;i++){cout<<a[i]<<' ';}cout<<endl;
#define NF(a,n,m) for(int i=0;i<n;i++){for(int j=0;j<m;j++){cin>>a[i][j];}}
#define NF1(a,n,m) for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){cin>>a[i][j];}}
#define PNF(a,n,m) for(int i=0;i<n;i++){for(int j=0;j<m;j++){cout<<a[i][j]<<' ';}cout<<endl;}cout<<endl;
#define PNF1(a,n,m) for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){cout<<a[i][j]<<' ';}cout<<endl;}cout<<endl;

using namespace std;

int recurse_sum(int ar[],int N,int i){
	
	if(i==N)
		return 0;
	
	return ar[i]+ recurse_sum(ar,N,i+1);
	
}

int main(){
	
	speed;
	boost;
	
	int T;
	cin>>T;
	
	int c=0;
	while(T--){
		c++;
	
		int N;
		cin>>N;
		int ar[N];
		F(ar,N);
	
		cout<<"Case "<<c<<": "<<recurse_sum(ar,N,0)<<endl;
		
	}
	
	return 0;
}