Cod sursa(job #2068596)
| Utilizator | Data | 18 noiembrie 2017 09:34:57 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m;
int v[20];
int use[20];
void bkt(int k)
{
int i;
if(k>m)
{
for(i=1;i<=m;i++)
fout<< v[i] << ' ';
fout<< '\n';
}
else
{
for(i=v[k-1]+1;i<=n;i++)
{
if(use[i]==0)
{
use[i]=1;
v[k]=i;
bkt(k+1);
use[i]=0;
}
}
}
}
int main()
{
fin>>n>>m;
bkt(1);
return 0;
}
