Cod sursa(job #1133690)
Utilizator | Data | 5 martie 2014 12:49:08 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
FILE *f,*g;
short int a[9];
int N;
int main()
{
f=fopen("permutari.in","r");
g=fopen("permutari.out","w");
fscanf(f,"%d",&N);
int q=1,l,i;
for(l=2;l<=N;l++) {q*=l;a[l]=l;}
a[1]=1;
for(l=1;l<=N;l++) fprintf(g,"%d ",a[l]);
fprintf(g,"\n");
for(l=1;l<=q-1;l++) {next_permutation(a+1,a+9);for(i=1;i<=8;i++) fprintf(g,"%d ",a[i]);fprintf(g,"\n");}
return 0;
}