Pagini recente » Cod sursa (job #170027) | Cod sursa (job #150395) | Cod sursa (job #2500611) | Cod sursa (job #2910077) | Cod sursa (job #1971461)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int Nmax=9;
int N,V[Nmax],j,Use[Nmax],K;
bool Ok(int i)
{
if((Use[V[i]]==0) && ((i==1) || (V[i]>V[i-1])))
{
Use[V[i]]=1;
return 1;
}
else return 0;
}
void Print()
{
for(int i=1;i<=K;++i)
{
fout<<V[i]<<" ";
}
fout<<"\n";
}
void Back(int i)
{
for(int j=1;j<=N;++j)
{
V[i]=j;
if(Ok(i))
{
if(i==K)
{
Print();
}
Back(i+1);
Use[j]=0;
}
}
}
int main()
{
fin>>N>>K;
Back(1);
return 0;
}