Cod sursa(job #915001)
| Utilizator | Data | 14 martie 2013 17:26:49 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m, c[20];
void afisare(){
for(int i=1; i<=m; ++i)
fout << c[i] << " ";
fout << "\n";
}
void comb(int k){
if(k-1 == m)
afisare();
else{
for(int i=c[k-1]+1; i<=n-m+k; ++i){
c[k] = i;
comb(k+1);
}
}
}
int main(){
fin >> n >> m;
comb(1);
fin.close();
fout.close();
return 0;
}
