Cod sursa(job #1097859)
| Utilizator | Data | 4 februarie 2014 00:45:46 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
int aux[20],n,k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void back(int pos) {
if (pos==k+1) {
for (int t=1; t<=k; ++t) fout<<aux[t]<<" ";
fout<<"\n";
}
else for (int i=aux[pos-1]+1; i<=n-k+pos; ++i) {
aux[pos]=i;
back(pos+1);
}
}
int main(void) {
fin>>n>>k;
back(1);
return(0);
}
