Cod sursa(job #937746)
Utilizator | Data | 10 aprilie 2013 23:27:04 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <algorithm>
#include <cstdio>
FILE *f=fopen("permutari.in","r");
FILE *g=fopen("permutari.out","w");
using namespace std;
int main()
{
int n[10],i,x;
fscanf(f,"%d",&x);
for(i=1;i<=x;i++)
n[i-1]=i;
do
{
for(i=1;i<=x;i++)
fprintf(g,"%d ",n[i-1]);
fprintf(g,"\n");
}
while(next_permutation(n,n+x));//codu'magic
return 0;
}