Cod sursa(job #2694323)
| Utilizator | Data | 8 ianuarie 2021 19:51:34 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <stdio.h>
#include <stdlib.h>
int v[18];
FILE *fin, *fout;
void back(int n, int k, int i, int min){
int j;
if(i==k){
for(j=0;j<k;j++)
fprintf(fout,"%d ",v[j]+1);
fprintf(fout,"\n");
} else{
for(j=min;j<n-k+i+1;j++){
v[i]=j;
back(n,k,i+1,j+1);
}
}
}
int main(){
int n,k;
fin=fopen("combinari.in","r");
fscanf(fin,"%d%d",&n,&k);
fclose(fin);
fout=fopen("combinari.out","w");
back(n,k,0,0);
fclose(fout);
return 0;
}
