Cod sursa(job #1456447)
| Utilizator | Data | 30 iunie 2015 21:10:04 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ofstream fout("combinari.out");
ifstream fin("combinari.in");
int n, m;
int v[20];
void afis()
{
for(int i=1; i<=m; i++) fout << v[i] << ' ';
fout << '\n';
}
void bkt(int pas)
{
for(int i=1; i<=n; i++) {
v[pas] = i;
if( (v[pas] > v[pas-1]) || pas == 1) {
if(pas == m) afis();
else bkt(pas + 1);
}
}
}
int main()
{
fin >> n >> m;
bkt(1);
fout.close();
fin.close();
return 0;
}
