Cod sursa(job #2506207)
| Utilizator | Data | 7 decembrie 2019 18:05:28 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int A[20],n,k,i;
void Afis()
{
for (i=1;i<=k;i++)
{
fout<<A[i]<<" ";
}
fout << "\n";
}
void Back(int x)
{
for (int i=A[x-1]+1; i<=n; i++)
{
A[x]=i;
if (x==k)
{
Afis();
}
else
{
Back(x+1);
}
}
}
int main()
{
fin>>n>>k;
Back(1);
return 0;
}
