Pagini recente » Cod sursa (job #1024878) | Cod sursa (job #1991933) | Cod sursa (job #1366786) | Cod sursa (job #911066) | Cod sursa (job #1011230)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int N,x[100];
void afisare (){
for(int i = 1; i <= N; i++){
g<<x[i]<<" ";
}
g<<"\n";
}
bool solutie ( int k ){
return ( k == N );
}
bool valid ( int k ){
for (int i = 1; i <= k; i++) {
if (x[i] == x[k]) {
return 0;
}
}
return 1;
}
void back(int k){
int i;
for(i=x[k-1]+1; i<=N; i++){
x[k]=i;
if(valid(k)){
if(solutie(k))
afisare();
else
back(k+1);
}
}
}
int main()
{
f>>N;
back(1);
return 0;
}