Cod sursa(job #974415)
| Utilizator | Data | 17 iulie 2013 10:23:34 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <cstdio>
//using namespace std;
int n;
const int Q=100;
bool ok[Q];
int v[Q];
void perm(int lv)
{
if(lv>=n+1)
{
for(int i=1; i<=n; i++)
printf("%d ",v[i]);
printf("\n");
}
else
{
for(int i=1; i<=n; i++)
{
if(ok[i]==0)
{
ok[i]=1;
v[lv]=i;
perm(lv+1);
ok[i]=0;
v[lv]=0;
}
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
//cout << "Hello world!" << endl;
scanf("%d",&n);
perm(1);
return 0;
}
