Pagini recente » Cod sursa (job #679543) | Istoria paginii utilizator/usako | Diferente pentru utilizator/ene_orlando_georgian_321cb intre reviziile 1 si 2 | Istoria paginii utilizator/iulian00 | Cod sursa (job #1510348)
#include <cstdio>
#include <algorithm>
using namespace std;
FILE *f = fopen ( "permutari.in" , "r" ) , *g = fopen ( "permutari.out" , "w" );
int N , perm [] = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 } , i;
int main()
{
//read
fscanf ( f , "%d" , &N );
//generate
do{
for ( i = 0 ; i < N ; i ++ )
fprintf ( g , "%d " , perm [ i ] );
fprintf ( g , "\n" );
} while ( next_permutation ( perm , perm + N ) ) ;
}