Cod sursa(job #2029812)
Utilizator | Data | 30 septembrie 2017 14:38:27 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int x[30], f[11];
int n, m;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void back(int nivel) {
if (nivel > m) {
for (int i=1;i<=m;i++)
fout<<x[i]<<" ";
fout<<"\n";
} else {
for (int i=x[nivel-1]+1;i<=n;i++) {
x[nivel] = i;
back(nivel+1);
}
}
}
int main()
{
fin>>n>>m;
back(1);
return 0;
}