Cod sursa(job #544772)
Utilizator | Data | 2 martie 2011 08:59:49 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream.h>
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,s[100],sol=0;
void afis()
{
for(int j=1;j<=m;j++)
g<<s[j]<<' ';
g<<"\n";
}
void back(int k)
{
for(int 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;
}