1.

//sirul lui Fibonacci

#include <iostream>
using namespace std;
int main()
{ int nr,a,b,c,i;
cin>>nr;
if(nr==1)
cout<<1;
else
if(nr==2)
cout<<1<<" ";
else
{ a=1;
b=1;
cout<<a<<" "<<b<<" ";
for(i=3; i<=nr; i++)
{
c=a+b;
a=b;
b=c;
cout<<c<<" ";
}
}
return 0;}
 2.
// cel mai mare numar din sirul lui Fibonacci mai mic decat un numar dat
#include <iostream>

using namespace std;

int main()
{
int x,a,b,c;
cin>>x;
a=1;
b=1;
while(a+b<x)
{
c=a+b;
a=b;
b=c;
}
cout<<c;
return 0;
}
 3.
//scrierea unui numar ca suma de termeni din sirul Fibonacci
#include <iostream>

using namespace std;

int main()
{
int n,a,b,c;
cin>>n;
while(n>0)
{
a=0;
b=1;
while(a+b<=n)
{
c=a+b;
a=b;
b=c;
}
cout<<c<<" ";
n=n-c;
}
return 0;
}