Cod sursa(job #1210583)
Utilizator | Data | 20 iulie 2014 15:23:15 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int x[20], n, m;
void back(int k) {
if (k > m) {
for (int i=1;i<=m;i++)
fout<<x[i]<<" ";
fout<<"\n";
return;
}
for (int i=x[k-1]+1;i<=n;i++) {
x[k] = i;
back(k+1);
}
}
int main () {
fin>>n>>m;
back(1);
return 0;
}