Cod sursa(job #405125)
| Utilizator | Data | 27 februarie 2010 16:30:35 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include<cstdio>
int main()
{
FILE *f=fopen("combinari.in","r"), *g=fopen("combinari.out","w");
int a[20],n,k,i,j,valid=1,x;
fscanf(f,"%d %d",&n,&k);
for(i=1;i<=k;i++)
{ a[i]=i;
fprintf(g,"%d ", a[i]);
}
fprintf(g,"\n");
valid=1;
do{
x=1;
i=k;
while(a[i]>=n)i--;
a[i]++;
i++;
while(i<=k){a[i]=a[i-1]+1; i++;
if(a[i-1]>n)x=0;
}
if(a[1]>(n-k+1))valid=0;
if((valid==1)&&(x==1)) { for(i=1;i<=k;i++)
fprintf(g,"%d ",a[i]);
fprintf(g,"\n");
}
}while(valid==1);
return 0;
}
