Cod sursa(job #2601367)
Utilizator | Lorintz Alexandru Alex_tz307 | Data | 14 aprilie 2020 13:14:03 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[32],n,p;
void Afis()
{
for(int j=1;j<=p;j++) g<<x[j]<<" ";
g<<'\n';
}
bool OK(int k)
{
for(int i = 1; i < k; ++i) if(x[k] == x[i]) return false;
return true;
}
bool Solutie(int k)
{
return k == p;
}
void back(int k)
{
for(int i=x[k-1] + 1 ; i<=n ; ++i)
{
x[k]=i;
if( OK(k) )
{
if(Solutie(k)) Afis();
else back(k+1);
}
}
}
int main()
{
f>>n>>p;
back(1);
f.close();
g.close();
return 0;
}