Cod sursa(job #1516915)
Utilizator | Data | 3 noiembrie 2015 18:37:02 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k, v[19];
void show()
{
for(int i=1;i<=k;i++)
out<<v[i]<<' ';
out<<'\n';
}
void bkt(int x)
{
for(int i=v[x-1]+1;i<=n;i++)
{
v[x]=i;
if(x==k)
show();
else
bkt(x+1);
}
}
int main(){
in>>n>>k;
bkt(1);
in.close();
out.close();
return 0;
}