Cod sursa(job #2494855)
Utilizator | Kulcsar Noemi Noemikulcsar | Data | 18 noiembrie 2019 17:07:37 |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,s[50];
int valid(int i)
{
for(int j=1;j<i;j++)
for(int k=j+1;k<=i;k++)
if(s[j]==s[k])
return 0;
for(int j=1;j<i;j++)
if(s[j]>s[j+1])
return 0;
return 1;
}
void afisare()
{
for(int i=1;i<=k;i++)
fout<<s[i]<<" ";
fout<<"\n";
}
void bk(int i)
{
for(int j=1;j<=n;j++)
{
s[i]=j;
if(valid(i))
{
if(i==k)
afisare();
else
bk(i+1);
}
}
}
int main()
{
fin>>n>>k;
bk(1);
return 0;
}