Pagini recente » Cod sursa (job #2468841) | Cod sursa (job #1486025) | Cod sursa (job #1000828) | Cod sursa (job #934183) | Cod sursa (job #1002545)
//#include <iostream>
#include <fstream>
using namespace std;
int a[20];
int main()
{
int i,j,k,n,c;
ifstream fin("combinari.in");
fin>>n>>k;
fin.close();
for(i=1;i<=k;i++)
a[i]=i;
c=n-k+1;
ofstream fout("combinari.out");
while(c!=a[1])
{
i=k;j=n;
while(a[i]==j)
i--,j--;
a[i]++;
for(j=i+1;j<=k;j++)
a[j]=a[j-1]+1;
for(i=1;i<=k;i++)
fout<<a[i]<<" ";
fout<<'\n';
}
fout.close();
return 0;
}