Pagini recente » Cod sursa (job #2443657) | Cod sursa (job #2598445) | Cod sursa (job #3225433) | Cod sursa (job #1228625) | Cod sursa (job #974415)
Cod sursa(job #974415)
#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;
}