Mai intai trebuie sa te autentifici.
Cod sursa(job #1906346)
Utilizator | Data | 6 martie 2017 13:29:44 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int st[18], n, k;
void Citire()
{
fin >> n >> k;
}
void Afisare()
{
for (int i=1; i<=k; i++)
fout << st[i] << " ";
fout << "\n";
}
void Back (int top)
{
int i;
if (top == k+1) Afisare();
else
for (i=st[top-1]+1; i<=n-k+top; i++)
{
st[top]=i;
Back(top+1);
}
}
int main ()
{
Citire();
Back(1);
fin.close();
fout.close();
return 0;
}