Takrorli bo’lmagan kombinatsiyalar


Download 19.81 Kb.
Sana05.07.2020
Hajmi19.81 Kb.
#123026
Bog'liq
Abduvahobov Murodbek diskret labarotoriya ishi


Takrorli bo’lmagan kombinatsiyalar

1)#include

using namespace std;

void almash(int *a, int i, int j) {

int s = a[i]; a[i] = a[j]; a[j] = s;

}

bool holatlar(int *a, int n) {



int j = n - 2;

while (j != -1 && a[j] >= a[j + 1]) j--;

if (j == -1)

return false;

int k = n - 1;

while (a[j] >= a[k]) k--;

almash(a, j, k);

int l = j + 1, r = n - 1; while (l

almash(a, l++, r--);

return true;

}

void Print(int *a, int n) {



static int num = 1;

cout.width(3); cout << num++ << ": ";

for (int i = 0; i < n; i++)

cout << a[i] << " ";

cout << endl;

}

void Urinalmashtirish(int *a, int n)



{

Print(a, n);

while (holatlar(a, n))

Print(a, n);

}

int main() {



int n, *a;

cout << "elementlar soni N = ";

cin >> n;

a = new int[n];

for (int i = 0; i < n; i++)

a[i] = i + 1;

Urinalmashtirish(a,n);
return 0;

}

2)#include

#include

using namespace std;

int main()

{

long long int p=1, m, n,i;



cin>>n;

long long int a[n+1];

for(i=1; i<=n; i++)

{

cin>>a[i];



}

cin>>m;


for(i=n-m+1; i<=n; i++)

{

p*=i;



}

for(i=1; i<=n; i++)

{

for(j=1; j<=m; j++)



{

for(k=j; k<=n; k++)

cout<

}


cout< }

cout<




return 0;

}

3)#include



#include

using namespace std;

int main()

{

long long int p=1,q=1, m, n;



cout<<"Iltimos to'plamning elementlari sonini kiriting n=";

cin>>n;

long long int a[n+1];

for(long long int i=1; i<=n; i++)

{

cin>>a[i];



}

cout<<"Gruppalash sonini kiritng m=";

cin>>m;

for(long long int i=1; i<=m; i++)

{

q*=i;


}

for( long long int i=n-m+1; i<=n; i++)

{

p*=i;


}

cout<<"Mumkin bo'lgan barcha guruppalashlar soni N="<




for(long long int i=1; i<=n; i++)

{

for(long long int j=i+1; j<=n; j++)



{

for(long long int k=j+1; k<=n; k++)

cout<

}


}

return 0;

}

4)#include

using namespace std;

int main()

{

long long p=1,s=1,m, n,k=1;



cout<<"Satr sonini kiriting iltimos n=";

cin>>n;

for(int i=0; i<=n; i++)

{ for(int u=i; u<=n; u++) cout<<" ";

for(int j=0; j<=i; j++)

{


p=1; s=1; k=1; cout.width(5);

for(int f=1; f<=i; f++)

{

p*=f;


}

for(int l=1; l<=j; l++)

{

s*=l;


}

for(int t=1; t<=(i-j); t++)

{

k*=t;


}

cout<



}

cout<

}

return 0;



}

5)#include

using namespace std;

long long int yusuf(long long int n, long long int k)

{

long long int p=1;



for (long long int i = 1; i <= k; i++)

p*=(n - k + i);

return p;

}

long long int faktorial(long long int n)



{

if(n==1)

return 1;

else


{

return n*(n-1);

}

}

int main()



{

long long int n;

cout << "Iltimos darajani kiriting n=";

cin >> n;

cout<< "a"<< "^"<

for (long long int i = 1; i <= n; i++)

{

cout<< yusuf(n, i) / faktorial(i)<<"*"<< "a"<<"^"<

}

cout<< "b"<<"^"<

return 0;

return 0;

}

7)#include


using namespace std;

long fac(int k){

long s=1;

for(int j=1;j<=k;j++)

s=s*j;

return s;



}

long binom(int x,int y){

if(y==x||y==0)return 1;

else


return fac(x)/(fac(y)*fac(x-y));

}

int main ()



{

int n, i, j;

cin>>n;cout<

for(i = 0; i <= n ; i++)

{

cout<<" "<

cout<<"C ="<

cout<<" "<

}

return 0;



}

Takrorli kombinatsiyalar.

1)#include

using namespace std;

long long faktorial(int n)

{

if(n==1)



return 1;

else


{

return n*faktorial(n-1);

}

}

int main()



{

long long p=1,s=1;

int m, n,i,j,y,d;

cout<<"n=";

cin>>n;

cout<<"k=";

cin>>d;

for(i=0; i

cin>>a[i];

for(j=1; j<=n; j++) p*=j;

for(i=0; i

{

p=p/faktorial(a[i]);



}

cout<<" mumkin bo'lgan takrorli o'rinlashtirishlar soni"<

cout<<"n="<


return 0;

}

2) #include

using namespace std;

bool holatlar(int *a, int n, int m) {

int j = m - 1;

while ( j>=0 && a[j] == n) j--;

if (j < 0) return false;

if (a[j] >= n)

j--;

a[j]++;


if (j == m - 1) return true;

for (int k = j + 1; k < m; k++)

a[k] = 1;

return true;

}

int main()



{

int n, m, *a;

cout << "N = ";

cin >> n;

cout << "M = ";

cin >> m;

int h = n > m ? n : m;

a = new int[h];

for (int i = 0; i < h; i++)

a[i] = 1;

int num = 1;

cout << num++ << ": ";

for (int i = 0; i < m; i++)

cout << a[i] << " ";

cout << endl;

while (holatlar(a, n, m))

{

cout << num++ << ": ";



for (int i = 0; i < m; i++)

cout << a[i] << " ";

cout << endl;

}
return 0;

}
3)#include

using namespace std;

long long faktorial(int n)

{

if(n==1)



return 1;

else


{

return n*faktorial(n-1);

}

}

int main()



{

long long p;

int m, n,l,d;

cout<<"n=";

cin>>n;

cout<<"m=";

cin>>m;

d=n+m-1; l=n-1;

p=fak(d)*1./(faktorial(m)*faktorial(l));

cout<<"Mumkin bo'lgan takrorli guruhlashlar soni"<<"\n";

cout<<"n="<


return 0;

}

4)#include

using namespace std;

long long fibonachchi(int n)

{

if(n==0||n==1)



return 1;

else


{

return fibonachchi(n-1)+fibonachchi(n-2);

}

}

int main()



{

int n;


cout<<"n=";

cin>>n;

cout<<"Fibonachi sonlar \n";

for(i=0; i

{

cout<

}

return 0;



}


Download 19.81 Kb.

Do'stlaringiz bilan baham:




Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©fayllar.org 2024
ma'muriyatiga murojaat qiling