Pagini recente » Cod sursa (job #2112649) | Cod sursa (job #1501309) | Cod sursa (job #290837) | Cod sursa (job #1670915) | Cod sursa (job #785626)
Cod sursa(job #785626)
//#include "stdafx.h"
#include <fstream>
using namespace std;
short n,m,k,x[21];
ifstream f("combinari.in"); ofstream g("combinari.out");
inline void afis()
{for(int i=1; i<=n; i++) g<<x[i]<<" ";
g<<"\n";
}
void back()
{k=1; x[k]=0;
do {while(1+x[k]<=m-n+k)
{x[k]++;
if(k == n) afis();
else {k++; x[k]=x[k-1];};
}
k--;
}
while(k);
}
int main()
{f>>m>>n;
back();
return 0;
}