Cod sursa(job #153733)
| Utilizator | Data | 10 martie 2008 18:23:10 | |
|---|---|---|---|
| Problema | Combinari | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream.h>
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n,m,sir[20];
void back (int k)
{
if ((k-1)==m)
{
for (int i=1;i<=m;i++)
fout<<sir[i]<<" ";
fout<<"\n";
return ;
}
for (int p=sir[k-1]+1;p<=n;p++)
{
sir[k]=p;
back(k+1);
}
}
int main ()
{
fin>>n>>m;
back(1);
fin.close();
fout.close();
return 0;
}