Pagini recente » Cod sursa (job #1269703) | Cod sursa (job #785880) | Cod sursa (job #1613263) | Cod sursa (job #2388040) | Cod sursa (job #1002544)
#include <iostream>
#include <fstream>
using namespace std;
int a[10];
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])
{
for(i=1;i<=k;i++)
fout<<a[i];
fout<<'\n';
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;
}