Pagini recente » Cod sursa (job #1009445) | Cod sursa (job #1971485) | Cod sursa (job #2437372) | Cod sursa (job #2839884) | Cod sursa (job #2285612)
#include <fstream>
using namespace std;
int x[10] ,n;
ofstream fout("permutari.out");
int OK(int k){
for(int i=1;i<k;++i)
if(x[k]==x[i])
return 0;
return 1;
}
void back(int k){
for(int i=1 ; i<=n ; ++i)
{
x[k]=i;
if( OK(k) )
if(k==n){
for( int j=1;j<=n;j++)
fout<<x[j]<<" ";
fout<<endl;
}
else
back(k+1);
}
}
int main(){
ifstream fin("permutari.in"); fin>>n; fin.close();
back(1);
fout.close();
return 0;
}