Cod sursa(job #355489)
Utilizator | Data | 11 octombrie 2009 12:19:40 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
ifstream fin("combinari.in");
ofstream fout("combinari.out");
#define endl '\n'
int n,st[50],m;
void afis(){
int i;
for(i=1;i<=m;i++) fout<<st[i]<<" ";
fout<<endl;
}
void bkt(int k){
if(k==m+1) afis();
else {
st[k]=st[k-1];
while(st[k]<n-m+k) {
st[k]++;
bkt(k+1);
}
}
}
int main(){
fin>>n>>m;
bkt(1);
return 0;
}