Cod sursa(job #1119096)
Utilizator | Data | 24 februarie 2014 15:13:09 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
using namespace std;
int N, K, V[20];
void Back(int Pos)
{
if(Pos == K + 1)
{
for(int i = 1; i <= K; ++ i)
printf("%i ", V[i]);
printf("\n");
return ;
}
for(int i = V[Pos - 1] + 1; i <= N - K + Pos; ++ i)
V[Pos] = i, Back(Pos + 1);
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%i %i", &N, &K);
Back(1);
}