Cod sursa(job #2380975)
Utilizator | Data | 15 martie 2019 19:08:12 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include<fstream>
using namespace std;
int sol[10000];
int n,k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void afisare(){
for(int i=1;i<=k;i++)
fout<<sol[i]<<" ";
fout<<'\n';
}
void back(int nr) {
if(nr==k+1) {
afisare();
}else {
for(int i=sol[nr-1]+1;i<=n;i++)
{
sol[nr]=i;
back(nr+1);
}
}
}
int main()
{
fin>>n>>k;
back(1);
return 0;
}