Cod sursa(job #1630039)
Utilizator | Data | 4 martie 2016 21:14:48 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#define nMax 20
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[nMax], k, n;
void back(int poz, int val)
{
if(poz>k)
{
for(int i=1;i<poz;i++)
fout<<v[i]<<" ";
fout<<'\n';
return;
}
for(int i=val;i<=n;i++)
{
v[poz]=i;
back(poz+1, i+1);
}
}
int main()
{
fin>>n>>k;
back(1, 1);
return 0;
}