SPOJ HRECURS - Hello Recursion
Problem Link: HRECURS - Hello Recursion
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0)
#define bfast cin.tie(0)
#define outs(x) cout << x << " "
#define outn(x) cout << x << "\n"
#define sf scanf
#define pf printf
#define pfn(x , k) printf(k , x)
#define nl puts("")
#define psb push_back
#define mset(c,v) memset(c , v , sizeof c)
#define loop0(n) for(int i=0; i<n; i++)
#define loop1(n) for(int i=1; i<=n; i++)
#define mpair(x , y) make_pair(x , y)
#define all(x) x.begin(), x.end()
#define pi acos(-1.0)
#define psb push_back
#define clr clear()
typedef unsigned long long ull;
typedef long long LL;
typedef vector<int>vii;
typedef vector<LL>vll;
typedef vector<string>vs;
typedef map<int, int>mpii;
typedef map<string, int>mpsi;
typedef map<char, int>mpci;
typedef map<LL, LL>mpll;
const int mod = 1000007;
const int high = 101;
int ar[high];
int getsum(int i , int N)
{
if(i == N-1) return ar[i];
return ar[i] + getsum(i+1 , N);
}
int main()
{
int test, tc=0;
sf("%d", &test);
while(test--)
{
int N , i;
sf("%d", &N);
for(i=0; i<N; i++)
{
sf("%d", &ar[i]);
}
pf("Case %d: %d\n", ++tc , getsum(0 , N));
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0)
#define bfast cin.tie(0)
#define outs(x) cout << x << " "
#define outn(x) cout << x << "\n"
#define sf scanf
#define pf printf
#define pfn(x , k) printf(k , x)
#define nl puts("")
#define psb push_back
#define mset(c,v) memset(c , v , sizeof c)
#define loop0(n) for(int i=0; i<n; i++)
#define loop1(n) for(int i=1; i<=n; i++)
#define mpair(x , y) make_pair(x , y)
#define all(x) x.begin(), x.end()
#define pi acos(-1.0)
#define psb push_back
#define clr clear()
typedef unsigned long long ull;
typedef long long LL;
typedef vector<int>vii;
typedef vector<LL>vll;
typedef vector<string>vs;
typedef map<int, int>mpii;
typedef map<string, int>mpsi;
typedef map<char, int>mpci;
typedef map<LL, LL>mpll;
const int mod = 1000007;
const int high = 101;
int ar[high];
int getsum(int i , int N)
{
if(i == N-1) return ar[i];
return ar[i] + getsum(i+1 , N);
}
int main()
{
int test, tc=0;
sf("%d", &test);
while(test--)
{
int N , i;
sf("%d", &N);
for(i=0; i<N; i++)
{
sf("%d", &ar[i]);
}
pf("Case %d: %d\n", ++tc , getsum(0 , N));
}
return 0;
}
jkj
ReplyDelete