Cod sursa(job #981935)
Utilizator | Data | 8 august 2013 10:35:14 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,m;
int sl[20];
void bk(int i)
{
if(m==k){
for(int j=1;j<=m;j++)
g<<sl[j]<<" ";
g<<'\n';
return;
}
for(int t=i;t<=n;t++){
sl[++m]=t;
bk(t+1);
--m;
}
return;
}
int main()
{
f>>n>>k;
bk(1);
return 0;
}