Cod sursa(job #1317099)
Utilizator | Data | 14 ianuarie 2015 16:00:54 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int sol[1001],n,k;
void afisare()
{
int i;
for(i=1; i<=k; i++) out<<sol[i]<<" ";
out<<"\n";
}
void bkt (int p)
{
int i;
for(i=sol[p-1]+1;i<=n-k+p;i++) {
sol[p]=i;
if(p==k)
afisare();
else bkt(p+1);
}
}
int main()
{
in>>n;
in>>k;
bkt(1);
return 0;
}