Cod sursa(job #2363514)
Utilizator | Pop Mihali Marco Silviu marcogold | Data | 3 martie 2019 13:51:51 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | pregatire_cls12_oji | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ofstream fo("combinari.out");
ifstream fi("combinari.in");
int n,k;
int sol[30];
void afis(int nivel)
{
for(int i=1;i<=k;i++)
fo<<sol[i]<<" ";
fo<<'\n';
}
void Back(int nivel)
{
for(int i=sol[nivel-1]+1;i<=n;i++)
{
sol[nivel]=i;
if(nivel==k)
afis(nivel);
else
Back(nivel+1);
}
}
int main()
{
fi>>n>>k;
Back(1);
fi.close();
fo.close();
return 0;
}