Cod sursa(job #3304848)
| Utilizator | Data | 28 iulie 2025 00:04:57 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#define NMAX 20
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N,K,v[NMAX];
void afisare()
{
for(int i=1; i<=K; i++)
{
fout<< v[i] << " ";
}
fout<< "\n";
}
void BACK(int p)
{
for(int i=v[p-1]+1; i<=N; i++)
{
v[p]=i;
if(p==K)
{
afisare();
}
else
{
BACK(p+1);
}
}
}
int main()
{
fin>>N>>K;
BACK(1);
return 0;
}
