Cod sursa(job #356883)
| Utilizator | Data | 17 octombrie 2009 11:42:06 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
void readd(),solve();
int x[10],i,j,f=1,n;
int main()
{
readd();
solve();
return 0;
}
void readd()
{
freopen("permutation.in","r",stdin);
freopen("permutation.out","w",stdout);
scanf("%d", &n);
}
void solve()
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%du", x[1]);
printf("\n");
next_permutation(x+1, x+n+1);
}
}
