Cod sursa(job #1541477)
| Utilizator | Data | 4 decembrie 2015 09:20:32 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k;
int st[20];
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;i++)
{
st[top]=i;
Back(top+1);
}
}
int main()
{
fin>>n>>k;
fin.close();
Back(1);
fout.close();
return 0;
}
