Cod sursa(job #528568)
| Utilizator | Data | 2 februarie 2011 23:37:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
using namespace std;
int n,k;
int A[21];
FILE *f,*g;
void bt(int v)
{
int i;
if (v==k)
{
for (i=1;i<=k;i++)
fprintf(g,"%d ",A[i]);
fprintf(g,"\n");
}
else
{
for (i=A[v]+1;i<=n;i++)
{
A[v+1]=i;
bt(v+1);
}
}
}
int main()
{
f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d %d",&n,&k);
bt(0);
fclose(f);
fclose(g);
return 0;
}
