Pagini recente » Cod sursa (job #539834) | Cod sursa (job #1693177) | Cod sursa (job #708378) | Cod sursa (job #1362229) | Cod sursa (job #2208615)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
int k,n,i,e[100];
cin>>n>>k;
for(i=1; i<=k; i++)
e[i]=i;
e[k]=e[k-1];
int poz=k;
while(1)
{
e[poz]++;
if(poz==k)
{ for(i=1;i<=k;i++)
cout<<e[i]<<" ";
cout<<"\n";
}
if(e[poz]==n){poz--; if(poz==0) break; }
else
if(poz<k) { poz++; e[poz]=e[poz-1]; if(e[poz-1]==n-1 && poz<k) break;}
}
return 0;
}