Cod sursa(job #2662893)
Utilizator | Data | 24 octombrie 2020 19:35:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,r[20];
void bck(int p,int poz)
{
if(poz-1==k)
{
for(int i=1;i<poz;++i)
out<<r[i]<<' ';
out<<'\n';
return;
}
for(int i=p;i<=n;++i)
{
r[poz]=i;
bck(i+1,poz+1);
}
return;
}
int main()
{
in>>n>>k;
bck(1,1);
return 0;
}