Cod sursa(job #979695)
| Utilizator | Data | 2 august 2013 15:05:32 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<iostream>
#include<stdio.h>
using namespace std;
FILE *f,*g;
int n,k,sol[100];
int back(int l)
{int i;
if(l==k+1)
{for(i=1;i<=k;i++)
fprintf(g,"%d ",sol[i]);
fprintf(g,"\n");
}
else
{if(l>1)
sol[l]=sol[l-1];
else
sol[l]=0;
while(sol[l]<n-k+l)
{sol[k]++;
back(l+1);
}
}
}
int main()
{
f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d%d",&n,&k);
back(1);
}
