Cod sursa(job #1107585)
Utilizator | Data | 13 februarie 2014 23:09:43 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <cstdio>
#define NMAX 20
using namespace std;
FILE* fin=fopen("combinari.in","r");
FILE* fout=fopen("combinari.out","w");
int e[NMAX],res[NMAX];
int main()
{
int i,n,m,ok=0;
fscanf(fin,"%d %d",&n,&m);
for(i=1; i<=m; i++)
res[i]=i;
while(!ok)
{
for(i=1; i<=m; i++)
fprintf(fout,"%d ",res[i]);
fprintf(fout,"\n");
i=m;
while(res[i]==n-m+i&&i>=0)
i--;
if(i==0) ok=1;
else
{
res[i]++;
for(int k=i+1; k<=n; k++)
res[k]=res[i]+k-i;
}
}
return 0;
}