1 dan n gacha sonlarning Yig’indisini topish dasturi Sum= Dastur kodi

1-Laboratoriya ishi
Yig’indi va ko’paytmalar

1. 
   1 dan n gacha sonlarning Yig’indisini topish dasturi
   

Sum=
Dastur kodi

#include

#include
using namespace std;
int main()
{
long long sum=0,i,n;
cin>>n;
for(i=1;i<=n;i++)
{
sum+=i;
}
cout<}

2. 
   1 dan n gacha sonlar ko’paytmasini topish;
   

P=
Dastur kodi

#include

#include
using namespace std;
int main()
{
long long P=1,i,n;
cin>>n;
for(i=1;i<=n;i++)
{
P*=i;
}
cout<
}
O’rin almashtirish va faktori

3. 
   n tartibli o’rin almashtirish.
   

P(n)=1*2*3*..*(n-1)*n=n!;
P(n)= P=
Dastur kodi

#include

#include
using namespace std;
int main()
{
long long P=1,i,n;
cin>>n;
for(i=1;i<=n;i++)
{
P*=i;
}
cout<
}

4. 
   n faktorialni topish
   

n!=1*2*3*..*n;
Dastur kodi
#include
#include
using namespace std;
long faktorial(long a)
{
if(a==0 || a==1)
return 1;
else return a*faktorial(a-1);
}
int main()
{
long long n;
cin>>n;
cout< return 0;
}
Fibonachi sonlarini topish

5. 
   n-Fibonachi sonini topish
   

f[1]=0;f[2]=1;

f[n]=f[n-1]+f[n-2];
Dastur kodi

#include

#include
using namespace std;
int main()
{
long long n,f[10000],i;
cin>>n;
f[1]=0;f[2]=1;
for(i=3;i<=n;i++)
{
f[i]=f[i-1]+f[i-2];
}
cout< return 0;
}