Cod sursa(job #1820766)
Utilizator | Data | 2 decembrie 2016 11:05:41 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream F ("combinari.in");
ofstream G ("combinari.out");
int n, k, st[20];
void backtr(int niv)
{
if(niv == k)
{
for(int j = 1; j <= niv; ++ j)
G << st[j] << " ";
G << '\n';
}
else
for(int i = st[niv] + 1; i <= n; ++ i)
{
st[niv + 1] = i;
backtr(niv + 1);
}
}
int main()
{
F >> n >> k;
backtr(0);
return 0;
}