Cod sursa(job #2196808)
Utilizator | Data | 20 aprilie 2018 14:01:47 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <cmath>
using namespace std;
int n, k, a;
int x[18];
ifstream f("combinari.in");
ofstream g("combinari.out");
int vf(int a)
{
if(x[a]<=x[a-1])
return 0;
return 1;
}
void bt(int a)
{
for(int i=1;i<=n;i++)
{
x[a]=i;
if(vf(a))
{
if(a==k)
{
for(int j=1;j<=a;j++)
g<<x[j]<<" ";
g<<endl;
}else
bt(a+1);
}
}
}
int main()
{
f>>n>>k;
bt(1);
return 0;
}