Cod sursa(job #2431821)
Utilizator | cosmin blotucosmin | Data | 20 iunie 2019 20:34:03 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[19], n, p;
void afis()
{
for(int i = 1; i <= p; i ++)
g << x[i] << " ";
g << "\n";
}
bool valid(int k)
{
for(int i = 1; i < k; i ++)
if(x[i] >= x[k]) return false;
return true;
}
void back(int k)
{
for(int i = 1; i <= n; i ++)
{
x[k] = i;
if(valid(k))
{
if(k == p) afis();
else back(k + 1);
}
}
}
int main()
{
f >> n >> p;
back(1);
return 0;
}