Cod sursa(job #2344608)
Utilizator | Data | 15 februarie 2019 12:32:00 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,x[20],viz[20];
void Afisare()
{ int i;
for(i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<"\n";
}
void Back(int y)
{ int i;
for(i=x[y-1]+1;i<=n;i++)
{
x[y]=i;
if(y==k) Afisare();
else Back(y+1);
}
}
int main()
{ fin>>n>>k;
Back(1);
return 0;
}