Pagini recente » Cod sursa (job #508710) | Cod sursa (job #1879867) | Cod sursa (job #1247495) | Cod sursa (job #2057236) | Cod sursa (job #1073307)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int nmax=18;
int n, k;
int v[nmax+1];
bool u[nmax+1];
void back( int x )
{
if ( x==k+1) {
for ( int i= 1; i<=k; ++i ) {
fout<<v[i]<<" ";
}
fout<<"\n";
} else {
for ( int i= v[x-1]+1; i<=n; ++i ) {
if ( u[i]==0 ) {
u[i]= 1;
v[x]=i;
back(x+1);
u[i]=0;
}
}
}
}
int main( )
{
fin>>n>>k;
back(1);
return 0;
}