Pagini recente » Cod sursa (job #2610374) | Cod sursa (job #1765482) | Cod sursa (job #558883) | Cod sursa (job #2458072) | Cod sursa (job #1026280)
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n,a[10];
int cont(int x){
for(int i=1;i<=x-1;i++)
if(a[i]=a[x])
return 0;
return 1;}
void scrie(int x){
for(int i=1;i<=n;i++)
out<<a[i];}
void back(int k){
int i;
for(i=1;i<=n;i++){
a[k]=i;
if(cont[k])
if(k==n)
scrie(k);
else
back(k+1);}}
int main()
{
in>>n;
back(1);
return 0;
}