Cod sursa(job #523926)
| Utilizator | Data | 19 ianuarie 2011 20:27:10 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
ifstream f("combinari.in"); ofstream g("combinari.out");
int n,m,k,x[20];
void prelsol()
{for(int i=1; i<=n; i++) g<<x[i]<<' ';
g<<'\n';
}
void back()
{k=1; x[k]=0;
do {while(x[k]<m-n+k)
{x[k]++;
if(k==n) prelsol();
else {k++; x[k]=x[k-1];};
}
k--;
}
while(k);
}
int main()
{f>>m>>n;
back();
g.close(); return 0;
}