Pagini recente » Cod sursa (job #1454902) | Cod sursa (job #2449370) | Cod sursa (job #690113) | Cod sursa (job #2862223) | Cod sursa (job #1920675)
#include <bits/stdc++.h>
using namespace std;
int a[20],n,k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void afisare()
{
int i;
for (i = 1 ; i <= k; i++ )
fout << a[i] <<" ";
fout << "\n";
}
void rezolvare()
{
int i , x, j;
for( i = 1;i <= k; i++ )
a[i] = i;
while(a[0] == 0)
{
afisare();
/// urmatoarea submultime de k elemente
x = n;
i = k;
while (a[i] == x)
{
x--;
i--;
}
a[i]++;
for(j = i+1; j <= k; j++)
a[j] = a[j-1] + 1;
}
}
int main()
{
fin>>n>>k;
rezolvare();
fin.close();
fout.close();
return 0;
}