Cod sursa(job #1820756)
Utilizator | Data | 2 decembrie 2016 10:54:44 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[20],i,j,N,K;
void write()
{
for(int i=1 ; i<=K ; ++i)
fout<<st[i]<<' ';
fout<<'\n';
}
void backtracking(int k)
{
if(k == K + 1)
write();
else
for(int i=st[k-1] + 1 ; i<=N ; ++i)
{
st[k]=i;
backtracking(k+1);
}
}
int main()
{
fin>>N>>K;
backtracking(1);
return 0;
}