Cod sursa(job #545119)
Utilizator | Data | 2 martie 2011 18:53:10 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream.h>
int s[100],n,ok,m;
ifstream f("combinari.in");
ofstream g("combinari.out");
void afis()
{ for(int i=1;i<=m;i++) g<<s[i]<<' ';
g<<'\n';
}
void back(int k)
{ int i;
for(i=s[k-1]+1;i<=n-m+k;i++)
{s[k]=i;
if(k==m) afis();
else back(k+1);
}
}
int main()
{ f>>n>>m;
back(1);
f.close();g.close();
return 0;
}