Cod sursa(job #1991092)
| Utilizator | Data | 15 iunie 2017 00:20:39 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m;
int x[110];
void Afisare ()
{
int i;
for (i=1;i<=m;i++)
fout<<x[i]<<" ";
fout<<"\n";
}
void Back(int k)
{
int i;
for (i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
if (k==m) Afisare();
else Back(k+1);
}
}
int main()
{
fin>>n>>m;
Back(1);
return 0;
}
