Cod sursa(job #1895259)
| Utilizator | Data | 27 februarie 2017 21:03:24 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int nmax=8;
int n,cnt=0;
int v[nmax+1], u[nmax+1];
void bt(int x)
{
if(x>n)
{
for(int i=1; i<=n; i++)
{
if(v[i]>v[x])
out<<v[i];
}
out<<"\n";
}
else
{
for(int i=1; i<=n; i++)
{
if ( u[i] == 0 ) {
v[x]=i;
u[i] = 1;
bt(x+1);
u[i] = 0;
}
}
}
}
int main()
{
in>>n;
bt(1);
return 0;
}
