TEST RECURSIVITATE

1.F(46)=011101122221
F(21)=1010112210
2.F(4)=aba
F(8)=abababa
3.F(5)=-2
F(10)=-4
4.F(2)=3
F(7)=8
5.F(5)=5 3 1
1 2 3 4 5

6.int F(int n,int x)

{if(n==0)
return 1;
else if(n==1)
return x;
else if(n>1)
return 2*n*F(n-1,x)-2*x*F(n-2,x);

}
8.#include <iostream>

using namespace std;

void citire(int v[],int n)

{
if(n!=0)
{
citire(v,n-1);
cin>>v[n];
}

}
void afisare(int v[],int n)

{
if(n!=0)
{if(n%2==1)
cout<<v[n]<<" ";
afisare(v,n-1);

int main()
{
int v[1005],n;
cin>>n;
citire(v,n);
afisare(v,n);
 return 0;
}