Pagini recente » Cod sursa (job #1846159) | Cod sursa (job #542640) | Cod sursa (job #1343591) | Cod sursa (job #1856100) | Cod sursa (job #563987)
Cod sursa(job #563987)
#include<fstream.h>
int n;
int v[100000];
ifstream f("permutari.in"); ofstream g("permutari.out");
int bun (int k){
int x = 0;
if ( k > n ) return 0;
if ( v[k] > n ) return 0;
for ( int i = 1; i <= k-1 && x == 0; i++ )
if ( v[i] == v[k] ) x = 1;
if ( x == 1 ) return 0;
return 1;
}
void afisare(){
for ( int i = 1; i <= n; i++) g << v[i] << " ";
g << "\n";
}
int back (int k){
if ( k == n + 1) afisare ();
else
for ( int i = 1; i <= n; i++){
v[k] = i;
if ( bun (k) ) back ( k + 1 );
}
}
int main(){
f >> n;
back (1);
g.close(); return 0;
}