Cod sursa(job #2486690)
Utilizator | Data | 3 noiembrie 2019 13:19:53 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,c,v[20];
void afis()
{
for(int i=1; i<=c; i++)
g<<v[i]<<" ";
g<<"\n";
}
bool valid(int k)
{
if(k==1)
return 1;
if(v[k]<v[k-1])
return 0;
for(int i=1;i<k;i++)
if(v[i]==v[k])
return 0;
return 1;
}
void bkt(int k)
{
for(int i=1;i<=n;i++)
{
v[k]=i;
if(valid(k))
{
if(k==c)
afis();
else bkt(k+1);
}
}
}
int main()
{
f>>n>>c;
bkt(1);
return 0;
}