Pagini recente » Borderou de evaluare (job #1134302) | Cod sursa (job #2970435) | Cod sursa (job #1608358) | Borderou de evaluare (job #2688711) | Cod sursa (job #805912)
Cod sursa(job #805912)
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f=fopen("permutari.in","r");
FILE *g=fopen("permutari.out","w");
int i,n,v[20];
int main()
{
fscanf(f,"%d",&n);
for (i=1; i<=n; i++) v[i]=i;
for (i=1;i<=n;i++)
fprintf(g,"%d ",v[i]);
fprintf(g,"\n");
while(next_permutation(v+1,v+n+1))
{
for (i=1;i<=n;i++)
fprintf(g,"%d ",v[i]);
fprintf(g,"\n");
}
return 0;
}