Cod sursa(job #339064)
| Utilizator | Data | 8 august 2009 00:15:45 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <stdio.h>
FILE*f=fopen("combinari.in","r");
FILE*g=fopen("combinari.out","w");
int i,k,st[9];
void solutie(){
for(i=1;i<=k;i++)
fprintf(g,"%d ",st[i]);
fprintf(g,"\n");
}
int main(){
int n,p=1,valid;
fscanf(f,"%d %d",&n,&k);
while(p>0)
if(st[p]<n){
st[p]++;
valid=1;
for(i=1;i<p;i++)
if(st[i]==st[k]) valid=0;
if(valid)
if(p==k){
solutie();}
else{
p++;
st[p]=st[p-1];}
}
else p--;
fclose(f);
fclose(g);
return 0;
}
