Cod sursa(job #2400992)
| Utilizator | Data | 9 aprilie 2019 12:38:24 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
int n,k;
int v[19];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void bkt(int nr, int poz)
{
int i=0;
if(poz==k+1)
{
for(int i=1; i<=k; i++)
{
fout<<v[i]<<" ";
}
fout<<"\n";
return;
}
for(i=nr; i<=n; i++)
{
v[poz]=i;
bkt(i+1, poz+1);
}
}
int main()
{
fin>>n>>k;
bkt(1,1);
}
