Cod sursa(job #2303477)
Utilizator | Data | 16 decembrie 2018 13:18:52 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,x[20],p,use[20];
void afiseaza()
{
for(int i=1;i<=p;i++)
fout<<x[i]<<' ';
fout<<'\n';
}
void bkt(int k)
{
if(k==p)
afiseaza();
else
for(int i=x[k]+1;i<=n;i++)
{
x[k+1]=i;
bkt(k+1);
}
}
int main()
{
fin>>n>>p;
bkt(0);
return 0;
}