Cod sursa(job #2420061)
| Utilizator | Data | 10 mai 2019 13:27:04 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int N,K,V[20];
int viz[20];
void BK(int cnt,int actual)
{
if(cnt==K+1)
{
for(int i=1;i<=K;i++) g<<V[i]<<" ";
g<<'\n';
return;
}
for(int i=actual;i<=N;i++)
if(viz[i]==0)
{
viz[i]=1;
V[cnt]=i;
BK(cnt+1,i+1);
viz[i]=0;
}
}
int main()
{
f>>N>>K;
BK(1,1);
return 0;
}
