Cod sursa(job #3357392)
| Utilizator | Data | 9 iunie 2026 11:08:23 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int fv[20];
int N,K,sir[20],nsir;
void bkt(int pas, int ult)
{
if(pas==K)
{
for(int i=1;i<=K;i++)
{
fout<<sir[i]<<' ';
}
fout<<'\n';
}
for(int i=ult+1;i<=N;i++)
{
if(fv[i]==0)
{
fv[i]=1;
nsir++;
sir[nsir]=i;
bkt(pas+1,i);
nsir--;
fv[i]=0;
}
}
}
int main()
{
fin>>N>>K;
bkt(0,0);
return 0;
}
