Pagini recente » Cod sursa (job #3212677) | Cod sursa (job #3036594) | Cod sursa (job #3276958) | Cod sursa (job #163495) | Cod sursa (job #229605)
Cod sursa(job #229605)
#include<fstream>
#include<iostream>
using namespace std;
bool used[20];
int sol[20];
int n,k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void back(int niv)
{
if( niv==k )
{
for(int i=0; i<k; i++)
fout<<sol[i]+1<<" ";
fout<<endl;
}
else
{
int st=(niv==0)?0:sol[niv-1]+1;
for(int i=st; i<n; i++)
if( !used[i] )
{
used[i] = true;
sol[niv] = i;
back(niv+1);
used[i] = false;
}
}
}
int main()
{
fin>>n>>k;
for(int i=0; i<n;i++) used[i] = false;
back(0);
fout.close();
return 0;
}