Cod sursa(job #898208)
Utilizator | Data | 28 februarie 2013 08:55:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <stdio.h>
int n, m;
bool A[20] = {0};
FILE * g;
void solve(int a, int i)
{
if(a==m)
{
for(int i=1; i<=n; i++) if(A[i] == true) fprintf(g, "%d ", i);
fprintf(g, "\n");
}
else
{
for(; i<=n; i++)
{
A[i] = true;
solve(a+1, i+1);
A[i] = false;
}
}
}
int main(void)
{
FILE * f;
f = fopen("combinari.in", "r");
g = fopen("combinari.out", "w");
fscanf(f, "%d %d", &n, &m);
solve(0, 1);
return 0;
}