Cod sursa(job #2401146)
| Utilizator | Data | 9 aprilie 2019 14:00:38 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int n,k,v[25];
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void bkt(int nr, int pos)
{
if(pos==k+1){
for(int i=1;i<=k;i++) fout<<v[i]<<" ";
fout<<"\n";
}
for(int i=nr;i<=n;i++){
v[pos]=i;
bkt(i+1,pos+1);
}
}
int main()
{
fin>>n>>k;
for(int i=1; i<=n; i++)
{
v[i]=i;
}
bkt(1,1);
return 0;
}
