Cod sursa(job #444510)
Utilizator | Data | 20 aprilie 2010 17:21:34 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,v[20];
void afisare()
{ for(int i=1;i<=k;i++)
g<<v[i]<<" ";
g<<'\n';
}
void back(int r)
{ if(r-1==k)
afisare();
else
for(int i=v[r-1]+1;i<=n-k+r;i++)
{ v[r]=i;
back(r+1);
}
}
int main()
{ f>>n>>k;
back(1);
f.close();
g.close();
return 0;
}