Pagini recente » Cod sursa (job #92943) | Cod sursa (job #1639167) | Cod sursa (job #1135931) | Cod sursa (job #1054732) | Cod sursa (job #1004604)
#include <fstream>
using namespace std;
int a[19];
int main()
{
int n,k,i,p,c,j;
ifstream fin ("combinari.in");
fin>>n>>k;
ofstream fout("combinari.out");
fin.close();
for(i = 1;i<=k;i++) a[i] = i;
for(i = 1;i<=k;i++) fout << a[i]<<" ";
fout <<"\n";
p = n-k+1;
while(a[1] != p)
{
// next subm
i = k;
c= n;
while (a[i] == c)
{i--;c--;}
a[i]++;
for (j = i+1; j <= k; j++)
a[j] = a[j-1] + 1;
//afis
for(i = 1;i<=k;i++)
fout << a[i]<<" ";
fout <<"\n";
}
fout.close();
return 0;
}