Pagini recente » Monitorul de evaluare | Istoria paginii runda/12341233 | Cod sursa (job #580790) | Cod sursa (job #755224) | Cod sursa (job #759809)
Cod sursa(job #759809)
#include <cstdio>
using namespace std;
int n, k, st[18];
void combinari(int);
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &k);
combinari(0);
return 0;
}
void combinari(int schritt)
{
for (int i = 1; i <= n; i++)
{
st[schritt] = i;
if (schritt + 1 == k)
{
for (int j = 0; j < k; j++)
printf("%d ", st[j]);
printf("\n");
}
else
combinari(schritt + 1);
}
}