Pagini recente » Cod sursa (job #2690018) | Cod sursa (job #754034) | Cod sursa (job #2528804) | Cod sursa (job #1406596) | Cod sursa (job #918761)
Cod sursa(job #918761)
#include <iostream>
#include <fstream>
using namespace std;
ofstream out("combinari.out");
ifstream in("combinari.in");
int s[19],n,m;
void scrie() {
int i;
for(i=1;i<=m;i++)
out<<s[i]<<" ";
out<<'\n';
}
void init(int k) {
if(k==1) s[k]=0;
else s[k]=s[k-1];
}
void bkt(int k) {
if(k==m+1) scrie();
else {
init(k);
while(s[k]<n-m+k) {
s[k]++;
bkt(k+1);
}
}
}
int main()
{
in>>n>>m;
bkt(1);
}