Cod sursa(job #1131706)
| Utilizator | Data | 1 martie 2014 00:40:31 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
#define n 19
using namespace std;
FILE *f=fopen("combinari.in","r");
FILE *g=fopen("combinari.out","w");
int N,K,s[n];
void a()
{
for(int i=1;i<=K;i++)
fprintf(g,"%d ",s[i]);
fprintf(g,"\n");
}
void b(int k)
{
for(int i=s[k-1]+1;i<=N;i++)
{
s[k]=i;
if(k==K) a();
else b(k+1);
}
}
int main()
{
fscanf(f,"%d%d",&N,&K); b(1);
return 0;
}
