Pagini recente » Cod sursa (job #1821775) | Cod sursa (job #2195169) | Cod sursa (job #2259260) | Cod sursa (job #133961) | Cod sursa (job #823856)
Cod sursa(job #823856)
#include<iostream>
#include<fstream>
using namespace std;
int a[200],b[200],nr_k=0,nr_kk=0;
void permutari(int k, int len,int K)
{
if(k-1 == len)
{
int ok=1;
nr_k=0;
for(int i = 2; i <= len; i++)
{
for(int j=1;j<i&&ok==1;j++)
if(a[j]>a[i])
ok=0;
if(ok==1)
nr_k++;
ok=1;
}
if(nr_k+1==K)
nr_kk++;
}
else
{
for(int i = 1; i <= len; i++)
if(!b[i])
{
a[k] = i;
b[i] = 1;
permutari(k+1, len,K);
b[i] = 0;
}
}
}
int main()
{
int N,K;
ifstream f_in("perm.in");
ofstream f_out("perm.out");
f_in>>N>>K;
permutari(1,N,K);
f_out<<nr_kk;
return 0;
}