Pagini recente » Cod sursa (job #1700207) | Cod sursa (job #941428) | Cod sursa (job #498046) | Cod sursa (job #1877830) | Cod sursa (job #1547210)
#include<iostream>
#include<fstream>
using namespace std;
int n,m,k;
int st[20];
ifstream f("combinari.in");
ofstream g("combinari.out");
void print(){
int i;
for (i=1; i<=m; i++)
g<<st[i]<<' ';
g<<'\n';
}
void GenComb(int k){
int i;
if (k==m+1)
print();
else
for (i=st[k-1]+1; i<=n-m+k; i++){
st[k]=i;
GenComb(k+1); //k++
}
}//k--
int main(){
f>>n>>m;
GenComb(1);
f.close();
g.close();
return 0;
}