Cod sursa(job #1043915)
Utilizator | Data | 29 noiembrie 2013 00:26:59 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int x[10],n;
int valid(int k)
{
int i;
if(k>1 and x[k]>=x[k-1])return 0;
return 1;
}
int solutie(int k)
{
return k==n;
}
void afisare(int k)
{
int i;
for(i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<"\n";
}
void back(int k)
{
for
(int i=1;i<=n;i++)
{
x[k]=i;
if(valid(k))
if(solutie(k))
afisare (k);
else
back(k+1);
}
}
int main()
{
fin>>n;
back(1);
return 0;
}