Cod sursa(job #1740306)
Utilizator | Data | 11 august 2016 13:45:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int NMAX=18;
int n,k;
int v[NMAX+1];
int f[NMAX+1];
void bt(int x)
{
if(x==k+1)
{
for(int i=1;i<=k;i++)
{
out<<v[i]<<" ";
}
out<<'\n';
}
else
{
for(int i=v[x-1]+1;i<=n;i++)
{
if(f[i]==0)
{
v[x]=i;
f[i]=1;
bt(x+1);
f[i]=0;
}
}
}
}
int main()
{
in>>n>>k;
bt(1);
return 0;
}