Cod sursa(job #2292592)
Utilizator | Mariciuc Ovidiu Oveeh | Data | 29 noiembrie 2018 18:46:39 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#define nmax 19
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m;
int x[nmax];
void Afisare(int k)
{
int i;
for(i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<"\n";
}
void Back(int k)
{
int i;
for(i=x[k-1]+1;i<=n-m+k;i++)
{
x[k]=i;
if(k==m) Afisare(k);
else Back(k+1);
}
}
int main()
{
fin>>n>>m;
Back(1);
return 0;
}