Cod sursa(job #1928850)
Utilizator | Data | 16 martie 2017 19:59:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <stdio.h>
using namespace std;
FILE *f=fopen("combinari.in","r");
FILE *g=fopen("combinari.out","w");
int v[20],k,n;
void back(int l)
{
int i;
if(l==k)
{
for(i=1;i<=k;i++)
{
fprintf(g,"%d ",v[i]);
}
fprintf(g,"\n");
}
else
{
for(i=v[l]+1;i<=n;i++)
{
v[l+1]=i;
back(l+1);
}
}
}
int main()
{
fscanf(f,"%d %d",&n,&k);
back(0);
return 0;
}