Cod sursa(job #499423)
Utilizator | Data | 9 noiembrie 2010 19:15:15 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream.h>
int n,st[19],m;
ifstream f("combinari.in");
ofstream g("combinari.out");
void afisare()
{int i;
for(i=1;i<=m;i++)
g<<st[i]<<" ";
g<<'\n';
}
void back(int p)
{int i;
for(i=st[p-1]+1;i<=n;i++)
{st[p]=i;
if(p==m)
afisare();
else back(p+1);
}
}
int main(void)
{
f>>n>>m;
back(1);
return 0;
}