Cod sursa(job #2068607)
| Utilizator | Data | 18 noiembrie 2017 09:44:18 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,curent,sol[20],use[20];
void bkt(int m)
{
if (m>k)
{
for (int i=1;i<m;i++)
cout<<sol[i]<<" ";
cout<<endl;
use[sol[m]]=0;
}
else for (int i=sol[m-1]+1;i<=n;i++)
if (use[i]==0)
{
use[i]=1;
sol[m]=i;
bkt(m+1);
use[i]=0;
}
}
int main()
{
cin>>n>>k;
bkt(1);
return 0;
}
