Cod sursa(job #2343545)
Utilizator | Berindean Razvan XDBerry | Data | 14 februarie 2019 08:51:13 |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int k , n ,sp[19] ;
void afisare()
{
for(int i=1;i<=k;i++)
{
out<<sp[i]<<" ";
}
out<<endl;
}
bool verif (int z)
{
if(sp[z-1]>=sp[z])
return 0;
return 1;
}
void bac(int x)
{
if(x>k)
{
afisare();
}
else
{
for(int i=1;i<=n;i++)
{
sp[x]=i;
if(verif(x))
bac(x+1);
}
}
}
int main()
{
in>>n>>k;
bac(1);
return 0;
}