Pagini recente » Cod sursa (job #1125757) | Cod sursa (job #1211851) | Cod sursa (job #2795821) | Cod sursa (job #2973956) | Cod sursa (job #2068572)
#include <fstream>
#include <stdio.h>
using namespace std;
int x[10] ,n;
ifstream hai("permutari.in");
FILE *pa=fopen("permutari.out","w");
int ok(int k){
for(int i=1; i<k; ++i)
if(x[k]==x[i])
return 0;
return 1;
}
void b(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++)
fprintf(pa,"%d ",x[j]);
fprintf(pa,"\n");
}
else
b(k+1);
}
}
int main(){
hai >> n;
b(1);
hai.close();
return 0;
}