Pagini recente » Cod sursa (job #2913976) | Cod sursa (job #2758489) | Cod sursa (job #2358099) | Cod sursa (job #724176) | Cod sursa (job #275630)
Cod sursa(job #275630)
#include<stdio.h>
int s[20];
int n,k,m;
FILE *f = fopen("combinari.in","r");
FILE *g = fopen("combinari.out","w");
int cond(int k){
int i;
for(i=1;i<k;i++)
if(s[i] == s[k] )
return 0;
return 1;
}
void sol(){
int i;
for(i=1;i<=m;i++)
fprintf(g,"%d ",s[i]);
fprintf(g,"\n");
}
int main(){
fscanf(f,"%d%d",&n,&m);
fclose(f);
k = 1;
s[1] = 0;
while(k>0)
if(s[k]<n){
s[k]++;
if(cond(k))
if(k==m)
sol();
else {
k++;
s[k] = s[k-1];
}
}else
k--;
fclose(g);
return 0;
}