Cod sursa(job #2721074)
Utilizator | Data | 11 martie 2021 15:51:23 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int a[20], n, k;
void afis()
{ for(int i=1; i<=k; i++)
fout << a[i] << ' ';
fout << '\n';
}
void bkt(int x)
{ if(x == k + 1)
afis();
else
{ for(int i=a[x-1]+1; i<=n; i++)
{ a[x] = i;
bkt(x + 1);
}
}
}
int main()
{
fin >> n >> k;
bkt(1);
return 0;
}