Cod sursa(job #2028278)
Utilizator | Data | 27 septembrie 2017 16:31:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream F("combinari.in");
ofstream G("combinari.out");
int n, k, st[15];
void backtr(int niv)
{
if(niv == k+1)
{
for(int i = 1; i <= k; ++ i) G << st[i] << " ";
G << '\n';
return;
}
for(int i = st[niv-1]+1; i <= n; ++ i)
{
st[niv]=i;
backtr(niv+1);
}
}
int main()
{
F >> n >> k;
backtr(1);
return 0;
}