Pagini recente » Cod sursa (job #3151811) | Cod sursa (job #901492) | Cod sursa (job #2200305) | Cod sursa (job #69279) | Cod sursa (job #514051)
Cod sursa(job #514051)
#include<iostream>
#include<fstream>
using namespace std;
int sol[4],n;
ifstream aa("permutari.in");
ofstream ss("permutari.out");
void back(int p);
bool verifica(int p);
int main () {
aa >> n;
back(1);
aa.close();
ss.close();
return 0;
}
bool verifica(int p){
int a=0;
for (int i=1;i<p;++i) if (sol[p]==sol[i]) a=1;
if (a==0) return true;
return false;
}
void back(int p) {
int i;
if (p>n) {
for (i=1;i<=n;++i)
ss << sol[i] << ' ';
ss << "\n";
return;
}
for(i=1;i<=n;++i) {
sol[p]=i;
if (verifica(p)) back(p+1);
}
}