Pagini recente » Cod sursa (job #168005) | Cod sursa (job #189358) | Cod sursa (job #2041712) | Cod sursa (job #953575) | Cod sursa (job #523894)
Cod sursa(job #523894)
#include<fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int i,n,x[100],k;
void afis(){
int i;
for(i=1;i<=n;i++)
g<<x[i]<<" ";
g<<'\n';
}
int conditie(int k){
int j;
for(j=1;j<k;j++)
if(x[k]==x[j])
return 0;
return 1;
}
void back(int k){
int i;
if(k==n+1)
afis();
else
for(i=1;i<=n;i++){
x[k]=i;
if(conditie(k)) back(k+1);
}
}
int main(){
f>>n;
back(1);
g.close();
return 0;
}