Pagini recente » Cod sursa (job #2552587) | Cod sursa (job #577729) | Cod sursa (job #2751561) | Cod sursa (job #1756144) | Cod sursa (job #653741)
Cod sursa(job #653741)
#include <fstream>
using namespace std;
ifstream in;
ofstream out;
int v[19];
int main()
{
int N,K;
in.open("combinari.in");
in>>N>>K;
in.close();
out.open("combinari.out");
for(int ind=1;1;)
{
if(ind>K)
{
--ind;
for(int i=1;i<K;++i)
out<<v[i]<<' ';
out<<v[K]<<'\n';
}
for(;ind&&v[ind]==N-K+ind;v[ind--]=0);
if(!ind) break;
if(v[ind]==0) v[ind]=v[ind-1]+1,++ind;
else
if(v[ind]<N) ++v[ind++];
}
out.close();
return 0;
}